/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/ldv-races/race-1_3-join.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:22:21,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:22:21,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:22:21,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:22:21,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:22:21,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:22:21,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:22:21,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:22:21,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:22:21,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:22:21,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:22:21,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:22:21,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:22:21,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:22:21,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:22:21,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:22:21,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:22:21,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:22:21,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:22:21,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:22:21,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:22:21,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:22:21,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:22:21,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:22:21,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:22:21,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:22:21,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:22:21,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:22:21,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:22:21,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:22:21,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:22:21,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:22:21,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:22:21,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:22:21,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:22:21,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:22:21,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:22:21,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:22:21,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:22:21,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:22:21,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:22:21,876 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-05 23:22:21,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:22:21,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:22:21,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:22:21,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:22:21,908 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:22:21,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:22:21,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:22:21,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:22:21,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:22:21,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:22:21,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:22:21,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:22:21,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:22:21,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:22:21,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:22:21,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:22:21,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:21,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:22:21,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:22:21,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:22:21,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:22:21,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:22:21,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:22:21,912 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-05 23:22:22,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:22:22,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:22:22,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:22:22,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:22:22,284 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:22:22,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-1_3-join.i [2022-12-05 23:22:23,470 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:22:23,816 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:22:23,816 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i [2022-12-05 23:22:23,839 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b0fffa5/a5b03df8a9694916be1f97c25aca7bbf/FLAGf57c9199d [2022-12-05 23:22:23,856 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5b0fffa5/a5b03df8a9694916be1f97c25aca7bbf [2022-12-05 23:22:23,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:22:23,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:22:23,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:23,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:22:23,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:22:23,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:23" (1/1) ... [2022-12-05 23:22:23,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c76415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:23, skipping insertion in model container [2022-12-05 23:22:23,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:22:23" (1/1) ... [2022-12-05 23:22:23,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:22:23,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:22:24,462 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2022-12-05 23:22:24,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:24,491 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:22:24,529 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-1_3-join.i[76153,76166] [2022-12-05 23:22:24,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:22:24,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:22:24,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:22:24,648 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:22:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24 WrapperNode [2022-12-05 23:22:24,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:22:24,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:24,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:22:24,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:22:24,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,710 INFO L138 Inliner]: procedures = 482, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2022-12-05 23:22:24,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:22:24,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:22:24,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:22:24,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:22:24,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,748 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:22:24,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:22:24,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:22:24,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:22:24,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (1/1) ... [2022-12-05 23:22:24,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:22:24,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:22:24,804 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-05 23:22:24,813 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-05 23:22:24,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-05 23:22:24,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:22:24,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 23:22:24,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 23:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:22:24,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:22:24,843 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:22:25,080 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:22:25,082 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:22:25,269 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:22:25,288 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:22:25,289 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:22:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:25 BoogieIcfgContainer [2022-12-05 23:22:25,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:22:25,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:22:25,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:22:25,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:22:25,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:22:23" (1/3) ... [2022-12-05 23:22:25,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e12452a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:25, skipping insertion in model container [2022-12-05 23:22:25,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:22:24" (2/3) ... [2022-12-05 23:22:25,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e12452a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:22:25, skipping insertion in model container [2022-12-05 23:22:25,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:22:25" (3/3) ... [2022-12-05 23:22:25,298 INFO L112 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2022-12-05 23:22:25,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:22:25,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 23:22:25,314 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:22:25,352 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:22:25,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 94 transitions, 196 flow [2022-12-05 23:22:25,446 INFO L130 PetriNetUnfolder]: 4/108 cut-off events. [2022-12-05 23:22:25,447 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:22:25,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 4/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 149 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2022-12-05 23:22:25,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 94 transitions, 196 flow [2022-12-05 23:22:25,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 168 flow [2022-12-05 23:22:25,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:25,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 81 transitions, 168 flow [2022-12-05 23:22:25,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 168 flow [2022-12-05 23:22:25,489 INFO L130 PetriNetUnfolder]: 2/91 cut-off events. [2022-12-05 23:22:25,489 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:22:25,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 2/91 cut-off events. For 1/1 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/84 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-12-05 23:22:25,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 81 transitions, 168 flow [2022-12-05 23:22:25,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-05 23:22:27,428 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:27,429 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:27,431 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:27,431 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,207 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,209 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,210 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 23:22:28,211 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-05 23:22:28,754 INFO L203 LiptonReduction]: Total number of compositions: 70 [2022-12-05 23:22:28,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:22:28,770 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;@3bff0747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:22:28,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:22:28,771 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:22:28,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:22:28,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:28,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1] [2022-12-05 23:22:28,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:22:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 349, now seen corresponding path program 1 times [2022-12-05 23:22:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750643556] [2022-12-05 23:22:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:29,022 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-05 23:22:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750643556] [2022-12-05 23:22:29,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750643556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:29,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:29,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-05 23:22:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659465222] [2022-12-05 23:22:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:22:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:22:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:22:29,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-05 23:22:29,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 13 transitions, 32 flow. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-05 23:22:29,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:29,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-05 23:22:29,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:29,085 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 23:22:29,086 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:22:29,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 14 events. 3/14 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 20 event pairs, 3 based on Foata normal form. 1/13 useless extension candidates. Maximal degree in co-relation 21. Up to 14 conditions per place. [2022-12-05 23:22:29,087 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 5 selfloop transitions, 0 changer transitions 2/8 dead transitions. [2022-12-05 23:22:29,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 8 transitions, 36 flow [2022-12-05 23:22:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:22:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:22:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-12-05 23:22:29,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:22:29,100 INFO L175 Difference]: Start difference. First operand has 16 places, 13 transitions, 32 flow. Second operand 2 states and 13 transitions. [2022-12-05 23:22:29,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 8 transitions, 36 flow [2022-12-05 23:22:29,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 32 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:22:29,105 INFO L231 Difference]: Finished difference. Result has 11 places, 6 transitions, 13 flow [2022-12-05 23:22:29,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=13, PETRI_PLACES=11, PETRI_TRANSITIONS=6} [2022-12-05 23:22:29,110 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, -5 predicate places. [2022-12-05 23:22:29,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:29,110 INFO L89 Accepts]: Start accepts. Operand has 11 places, 6 transitions, 13 flow [2022-12-05 23:22:29,112 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:29,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:29,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 6 transitions, 13 flow [2022-12-05 23:22:29,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 8 places, 6 transitions, 13 flow [2022-12-05 23:22:29,125 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:22:29,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:22:29,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 5 event pairs, 0 based on Foata normal form. 0/5 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:22:29,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 8 places, 6 transitions, 13 flow [2022-12-05 23:22:29,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-05 23:22:29,133 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:22:29,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:22:29,143 INFO L495 AbstractCegarLoop]: Abstraction has has 8 places, 6 transitions, 13 flow [2022-12-05 23:22:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-05 23:22:29,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:29,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:22:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:22:29,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:22:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 11030101, now seen corresponding path program 1 times [2022-12-05 23:22:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547684991] [2022-12-05 23:22:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:29,335 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-05 23:22:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547684991] [2022-12-05 23:22:29,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547684991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:29,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:29,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:22:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715554735] [2022-12-05 23:22:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:29,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:22:29,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:29,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:22:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:22:29,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 6 [2022-12-05 23:22:29,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 8 places, 6 transitions, 13 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:22:29,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:29,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 6 [2022-12-05 23:22:29,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:29,355 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:22:29,355 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:22:29,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 8 events. 0/8 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 2/10 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-12-05 23:22:29,355 INFO L137 encePairwiseOnDemand]: 3/6 looper letters, 3 selfloop transitions, 2 changer transitions 2/7 dead transitions. [2022-12-05 23:22:29,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 7 transitions, 27 flow [2022-12-05 23:22:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:22:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:22:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-12-05 23:22:29,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:22:29,357 INFO L175 Difference]: Start difference. First operand has 8 places, 6 transitions, 13 flow. Second operand 3 states and 10 transitions. [2022-12-05 23:22:29,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 7 transitions, 27 flow [2022-12-05 23:22:29,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 7 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:22:29,358 INFO L231 Difference]: Finished difference. Result has 11 places, 5 transitions, 19 flow [2022-12-05 23:22:29,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=6, PETRI_DIFFERENCE_MINUEND_FLOW=13, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19, PETRI_PLACES=11, PETRI_TRANSITIONS=5} [2022-12-05 23:22:29,359 INFO L294 CegarLoopForPetriNet]: 16 programPoint places, -5 predicate places. [2022-12-05 23:22:29,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:29,359 INFO L89 Accepts]: Start accepts. Operand has 11 places, 5 transitions, 19 flow [2022-12-05 23:22:29,359 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:29,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:29,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 5 transitions, 19 flow [2022-12-05 23:22:29,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 10 places, 5 transitions, 19 flow [2022-12-05 23:22:29,362 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-05 23:22:29,362 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:22:29,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13 conditions, 5 events. 0/5 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 0/5 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:22:29,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 10 places, 5 transitions, 19 flow [2022-12-05 23:22:29,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:22:29,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L1712-4-->L1724: Formula: (and (= 0 |v_ULTIMATE.start_module_init_#res#1_45|) (= (store |v_#valid_53| |v_ULTIMATE.start_module_exit_~#status~0#1.base_26| 1) |v_#valid_52|) (= v_~pdev~0_93 4) (= |v_#length_47| (store |v_#length_48| |v_ULTIMATE.start_module_exit_~#status~0#1.base_26| 4)) (= |v_ULTIMATE.start_module_exit_~#status~0#1.offset_26| 0) (not (= |v_ULTIMATE.start_module_exit_~#status~0#1.base_26| 0)) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_module_exit_~#status~0#1.base_26|) (= (select |v_#valid_53| |v_ULTIMATE.start_module_exit_~#status~0#1.base_26|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_53|, #length=|v_#length_48|} OutVars{ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_28|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_35|, ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_72|, ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_26|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_26|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_28|, ~pdev~0=v_~pdev~0_93, #valid=|v_#valid_52|, ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_28|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_25|, #length=|v_#length_47|, ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~mem35#1, ULTIMATE.start_module_exit_#t~nondet36#1.base, ~pdev~0, ULTIMATE.start_module_init_#t~pre33#1, #valid, ULTIMATE.start_main_#t~ret37#1, ULTIMATE.start_module_exit_#t~nondet36#1.offset, ULTIMATE.start_module_init_#t~nondet34#1, ULTIMATE.start_module_exit_~#status~0#1.base, #length, ULTIMATE.start_module_exit_~#status~0#1.offset, ULTIMATE.start_module_init_#res#1] and [327] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#mutex~0.base_56|))) (and (= (select .cse0 |v_~#mutex~0.offset_56|) 0) (= 6 v_~pdev~0_95) (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#mutex~0.base_56| (store .cse0 |v_~#mutex~0.offset_56| 0))) (= |v_thread1Thread1of1ForFork0_#res.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#in~arg.base_5| v_thread1Thread1of1ForFork0_~arg.base_5) (= |v_thread1Thread1of1ForFork0_#res.base_13| 0) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_5| v_thread1Thread1of1ForFork0_~arg.offset_5))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_5|, ~#mutex~0.base=|v_~#mutex~0.base_56|, ~#mutex~0.offset=|v_~#mutex~0.offset_56|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_5|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_13|, ~#mutex~0.base=|v_~#mutex~0.base_56|, ~pdev~0=v_~pdev~0_95, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_5, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_5, ~#mutex~0.offset=|v_~#mutex~0.offset_56|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_13|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_5|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_21|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, ~pdev~0, thread1Thread1of1ForFork0_~arg.offset, thread1Thread1of1ForFork0_~arg.base, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_#t~nondet31] [2022-12-05 23:22:29,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [334] L1712-4-->thread1EXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_98| |v_~#mutex~0.base_70|))) (and (= 6 v_~pdev~0_120) (not (= |v_ULTIMATE.start_module_exit_~#status~0#1.base_38| 0)) (= |v_#pthreadsMutex_97| (store |v_#pthreadsMutex_98| |v_~#mutex~0.base_70| (store .cse0 |v_~#mutex~0.offset_70| 0))) (= (store |v_#length_66| |v_ULTIMATE.start_module_exit_~#status~0#1.base_38| 4) |v_#length_65|) (= (select |v_#valid_71| |v_ULTIMATE.start_module_exit_~#status~0#1.base_38|) 0) (= |v_thread1Thread1of1ForFork0_#res.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_21| 0) (= |v_ULTIMATE.start_module_exit_~#status~0#1.offset_38| 0) (< |v_#StackHeapBarrier_39| |v_ULTIMATE.start_module_exit_~#status~0#1.base_38|) (= (store |v_#valid_71| |v_ULTIMATE.start_module_exit_~#status~0#1.base_38| 1) |v_#valid_70|) (= 0 |v_ULTIMATE.start_module_init_#res#1_57|) (= |v_thread1Thread1of1ForFork0_#in~arg.base_13| v_thread1Thread1of1ForFork0_~arg.base_13) (= |v_thread1Thread1of1ForFork0_#in~arg.offset_13| v_thread1Thread1of1ForFork0_~arg.offset_13) (= 0 (select .cse0 |v_~#mutex~0.offset_70|)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_98|, #StackHeapBarrier=|v_#StackHeapBarrier_39|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_13|, ~#mutex~0.base=|v_~#mutex~0.base_70|, #valid=|v_#valid_71|, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_13|, #length=|v_#length_66|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_97|, thread1Thread1of1ForFork0_#in~arg.base=|v_thread1Thread1of1ForFork0_#in~arg.base_13|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_21|, ~#mutex~0.base=|v_~#mutex~0.base_70|, thread1Thread1of1ForFork0_~arg.offset=v_thread1Thread1of1ForFork0_~arg.offset_13, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_38|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_47|, ~#mutex~0.offset=|v_~#mutex~0.offset_70|, ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_84|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_21|, ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_38|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_38|, #StackHeapBarrier=|v_#StackHeapBarrier_39|, ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_36|, ~pdev~0=v_~pdev~0_120, thread1Thread1of1ForFork0_~arg.base=v_thread1Thread1of1ForFork0_~arg.base_13, #valid=|v_#valid_70|, ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_38|, ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_35|, thread1Thread1of1ForFork0_#in~arg.offset=|v_thread1Thread1of1ForFork0_#in~arg.offset_13|, #length=|v_#length_65|, thread1Thread1of1ForFork0_#t~nondet31=|v_thread1Thread1of1ForFork0_#t~nondet31_29|, ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_57|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~arg.offset, ULTIMATE.start_module_exit_#t~nondet36#1.base, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_main_#t~ret37#1, thread1Thread1of1ForFork0_#res.offset, ULTIMATE.start_module_exit_~#status~0#1.base, ULTIMATE.start_module_exit_~#status~0#1.offset, ULTIMATE.start_module_exit_#t~mem35#1, ~pdev~0, thread1Thread1of1ForFork0_~arg.base, #valid, ULTIMATE.start_module_exit_#t~nondet36#1.offset, ULTIMATE.start_module_init_#t~nondet34#1, #length, thread1Thread1of1ForFork0_#t~nondet31, ULTIMATE.start_module_init_#res#1] and [208] L1724-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| 0) (= |v_ULTIMATE.start_ldv_assert_~expression#1_29| |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|) (= (ite (= v_~pdev~0_13 4) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_13|)) InVars {~pdev~0=v_~pdev~0_13} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_29|, ~pdev~0=v_~pdev~0_13, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_ldv_assert_#in~expression#1] [2022-12-05 23:22:29,666 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:22:29,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-05 23:22:29,667 INFO L495 AbstractCegarLoop]: Abstraction has has 8 places, 3 transitions, 13 flow [2022-12-05 23:22:29,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-05 23:22:29,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:29,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:22:29,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:22:29,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-12-05 23:22:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash 355812, now seen corresponding path program 1 times [2022-12-05 23:22:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:29,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965727259] [2022-12-05 23:22:29,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:29,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:22:29,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:22:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:22:29,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:22:29,725 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:22:29,726 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:22:29,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:22:29,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-12-05 23:22:29,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-12-05 23:22:29,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-05 23:22:29,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:22:29,728 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-12-05 23:22:29,732 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:22:29,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:22:29,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:22:29 BasicIcfg [2022-12-05 23:22:29,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:22:29,749 INFO L158 Benchmark]: Toolchain (without parser) took 5889.86ms. Allocated memory was 207.6MB in the beginning and 298.8MB in the end (delta: 91.2MB). Free memory was 181.0MB in the beginning and 193.5MB in the end (delta: -12.5MB). Peak memory consumption was 78.7MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,749 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:22:29,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.94ms. Allocated memory is still 207.6MB. Free memory was 181.0MB in the beginning and 124.3MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.91ms. Allocated memory is still 207.6MB. Free memory was 124.3MB in the beginning and 121.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,750 INFO L158 Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 207.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,751 INFO L158 Benchmark]: RCFGBuilder took 535.89ms. Allocated memory was 207.6MB in the beginning and 298.8MB in the end (delta: 91.2MB). Free memory was 119.1MB in the beginning and 270.9MB in the end (delta: -151.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,751 INFO L158 Benchmark]: TraceAbstraction took 4455.86ms. Allocated memory is still 298.8MB. Free memory was 270.4MB in the beginning and 193.5MB in the end (delta: 76.9MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. [2022-12-05 23:22:29,753 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 184.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 786.94ms. Allocated memory is still 207.6MB. Free memory was 181.0MB in the beginning and 124.3MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.91ms. Allocated memory is still 207.6MB. Free memory was 124.3MB in the beginning and 121.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.44ms. Allocated memory is still 207.6MB. Free memory was 121.2MB in the beginning and 119.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 535.89ms. Allocated memory was 207.6MB in the beginning and 298.8MB in the end (delta: 91.2MB). Free memory was 119.1MB in the beginning and 270.9MB in the end (delta: -151.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4455.86ms. Allocated memory is still 298.8MB. Free memory was 270.4MB in the beginning and 193.5MB in the end (delta: 76.9MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 82 PlacesBefore, 16 PlacesAfterwards, 81 TransitionsBefore, 13 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 52 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 117, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 107, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 107, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 107, unknown conditional: 0, unknown unconditional: 107] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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, 8 PlacesBefore, 8 PlacesAfterwards, 6 TransitionsBefore, 6 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.3s, 10 PlacesBefore, 8 PlacesAfterwards, 5 TransitionsBefore, 3 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 4, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 1695]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1696] 0 pthread_t t1; [L1697] 0 pthread_mutex_t mutex; [L1698] 0 int pdev; [L1734] CALL, EXPR 0 module_init() [L1709] 0 pdev = 1 [L1710] CALL 0 ldv_assert(pdev==1) [L1695] COND FALSE 0 !(!expression) [L1710] RET 0 ldv_assert(pdev==1) [L1711] COND TRUE 0 __VERIFIER_nondet_int() [L1712] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [arg={0:0}, mutex={4:0}, pdev=1, pthread_create(&t1, ((void *)0), thread1, ((void *)0))=-1, t1={3:0}] [L1713] 0 return 0; [L1734] RET, EXPR 0 module_init() [L1734] COND FALSE 0 !(module_init()!=0) [L1735] CALL 0 module_exit() [L1721] 0 void *status; [L1723] 0 pdev = 4 [L1702] 0 pdev = 6 [L1705] 0 return 0; [L1726] CALL 0 ldv_assert(pdev==4) [L1695] COND TRUE 0 !expression [L1695] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, expression=0, mutex={4:0}, pdev=6, t1={3:0}] - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1695]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 99 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:22:29,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...