./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/twostage_3.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 05:53:35,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 05:53:35,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 05:53:35,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 05:53:35,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 05:53:35,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 05:53:35,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 05:53:35,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 05:53:35,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 05:53:35,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 05:53:35,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 05:53:35,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 05:53:35,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 05:53:35,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 05:53:35,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 05:53:35,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 05:53:35,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 05:53:35,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 05:53:35,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 05:53:35,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 05:53:35,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 05:53:35,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 05:53:35,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 05:53:35,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 05:53:35,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 05:53:35,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 05:53:35,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 05:53:35,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 05:53:35,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 05:53:35,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 05:53:35,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:53:35,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 05:53:35,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 05:53:35,785 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 05:53:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 05:53:35,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 05:53:35,789 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 05:53:35,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 05:53:35,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 05:53:35,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 05:53:35,790 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 05:53:35,791 INFO L153 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 05:53:36,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 05:53:36,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 05:53:36,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 05:53:36,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 05:53:36,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 05:53:36,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/twostage_3.i [2024-10-19 05:53:37,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 05:53:37,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 05:53:37,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i [2024-10-19 05:53:37,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8a76a6457/421268631d844b77b865ebcee2bc35c1/FLAG0d956d4eb [2024-10-19 05:53:37,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8a76a6457/421268631d844b77b865ebcee2bc35c1 [2024-10-19 05:53:37,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 05:53:37,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 05:53:37,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 05:53:37,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 05:53:37,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 05:53:37,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:53:37" (1/1) ... [2024-10-19 05:53:37,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e146af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:37, skipping insertion in model container [2024-10-19 05:53:37,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:53:37" (1/1) ... [2024-10-19 05:53:37,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 05:53:38,451 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2024-10-19 05:53:38,518 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:38,519 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:38,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:53:38,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 05:53:38,626 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2024-10-19 05:53:38,639 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:38,640 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:38,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:53:38,709 INFO L204 MainTranslator]: Completed translation [2024-10-19 05:53:38,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38 WrapperNode [2024-10-19 05:53:38,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 05:53:38,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 05:53:38,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 05:53:38,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 05:53:38,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,756 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2024-10-19 05:53:38,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 05:53:38,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 05:53:38,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 05:53:38,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 05:53:38,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 05:53:38,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 05:53:38,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 05:53:38,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 05:53:38,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (1/1) ... [2024-10-19 05:53:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:53:38,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:53:38,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 05:53:38,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 05:53:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2024-10-19 05:53:38,871 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2024-10-19 05:53:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2024-10-19 05:53:38,872 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 05:53:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 05:53:38,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 05:53:38,874 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 05:53:39,004 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 05:53:39,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 05:53:39,283 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 05:53:39,283 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 05:53:39,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 05:53:39,530 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 05:53:39,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:39 BoogieIcfgContainer [2024-10-19 05:53:39,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 05:53:39,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 05:53:39,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 05:53:39,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 05:53:39,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 05:53:37" (1/3) ... [2024-10-19 05:53:39,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b111a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:53:39, skipping insertion in model container [2024-10-19 05:53:39,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:38" (2/3) ... [2024-10-19 05:53:39,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b111a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:53:39, skipping insertion in model container [2024-10-19 05:53:39,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:39" (3/3) ... [2024-10-19 05:53:39,544 INFO L112 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2024-10-19 05:53:39,564 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 05:53:39,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 05:53:39,565 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 05:53:39,623 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 05:53:39,666 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 05:53:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 05:53:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:53:39,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 05:53:39,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 05:53:39,770 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 05:53:39,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:39,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread1of1ForFork1 ======== [2024-10-19 05:53:39,795 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3aecbe64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 05:53:39,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 05:53:40,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1846882738, now seen corresponding path program 1 times [2024-10-19 05:53:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:53:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339240585] [2024-10-19 05:53:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:53:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:53:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:53:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:53:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:53:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339240585] [2024-10-19 05:53:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339240585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 05:53:41,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 05:53:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-19 05:53:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111338509] [2024-10-19 05:53:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 05:53:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 05:53:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:53:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 05:53:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-19 05:53:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:41,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:53:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:53:41,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:42,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 05:53:42,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:42,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1506294770, now seen corresponding path program 2 times [2024-10-19 05:53:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:53:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298649344] [2024-10-19 05:53:42,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:53:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:53:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:53:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:53:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:53:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298649344] [2024-10-19 05:53:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298649344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:53:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755187093] [2024-10-19 05:53:42,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 05:53:42,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:53:42,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:53:42,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 05:53:42,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-19 05:53:43,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 05:53:43,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:53:43,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-19 05:53:43,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:53:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-19 05:53:43,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-19 05:53:43,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 05:53:43,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-19 05:53:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:53:43,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 05:53:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755187093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 05:53:43,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-19 05:53:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-10-19 05:53:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667553352] [2024-10-19 05:53:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 05:53:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 05:53:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:53:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 05:53:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-19 05:53:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:43,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:53:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:53:43,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:43,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 05:53:43,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-19 05:53:43,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-19 05:53:43,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1389779958, now seen corresponding path program 3 times [2024-10-19 05:53:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:53:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812659488] [2024-10-19 05:53:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:53:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:53:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:53:43,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:53:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:53:43,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 05:53:43,963 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 05:53:43,965 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 05:53:43,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-19 05:53:43,980 INFO L414 BasicCegarLoop]: Path program histogram: [3] [2024-10-19 05:53:43,984 INFO L312 ceAbstractionStarter]: Result for error location funcBThread1of1ForFork1 was UNSAFE (1/2) [2024-10-19 05:53:44,060 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 05:53:44,060 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 05:53:44,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 05:53:44 BasicIcfg [2024-10-19 05:53:44,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 05:53:44,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 05:53:44,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 05:53:44,064 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 05:53:44,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:39" (3/4) ... [2024-10-19 05:53:44,067 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-19 05:53:44,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 05:53:44,069 INFO L158 Benchmark]: Toolchain (without parser) took 6163.22ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 83.0MB in the beginning and 106.6MB in the end (delta: -23.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,070 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 05:53:44,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.92ms. Allocated memory is still 140.5MB. Free memory was 83.0MB in the beginning and 84.7MB in the end (delta: -1.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.26ms. Allocated memory is still 140.5MB. Free memory was 84.7MB in the beginning and 82.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,074 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 140.5MB. Free memory was 82.0MB in the beginning and 79.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,074 INFO L158 Benchmark]: RCFGBuilder took 736.80ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 79.8MB in the beginning and 165.7MB in the end (delta: -85.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,074 INFO L158 Benchmark]: TraceAbstraction took 4528.97ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 107.6MB in the end (delta: 57.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-10-19 05:53:44,074 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 207.6MB. Free memory was 107.6MB in the beginning and 106.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 05:53:44,076 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 140.5MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.92ms. Allocated memory is still 140.5MB. Free memory was 83.0MB in the beginning and 84.7MB in the end (delta: -1.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.26ms. Allocated memory is still 140.5MB. Free memory was 84.7MB in the beginning and 82.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 140.5MB. Free memory was 82.0MB in the beginning and 79.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.80ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 79.8MB in the beginning and 165.7MB in the end (delta: -85.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4528.97ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 107.6MB in the end (delta: 57.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 207.6MB. Free memory was 107.6MB in the beginning and 106.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 164, dependent conditional: 132, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1248, independent: 1213, independent conditional: 38, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1248, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 911, independent conditional: 119, independent unconditional: 793, dependent: 840, dependent conditional: 34, dependent unconditional: 807, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1747, independent conditional: 268, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1248, unknown conditional: 41, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1213, Positive conditional cache size: 38, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1248, independent: 1213, independent conditional: 38, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1248, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 911, independent conditional: 119, independent unconditional: 793, dependent: 840, dependent conditional: 34, dependent unconditional: 807, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1747, independent conditional: 268, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1248, unknown conditional: 41, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1213, Positive conditional cache size: 38, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371 ], Independence queries for same thread: 125, Persistent sets #1 benchmarks: Persistent set computation time: 1.6s, Number of persistent set computation: 220, Number of trivial persistent sets: 173, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1297, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 164, dependent conditional: 132, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1248, independent: 1213, independent conditional: 38, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1248, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 911, independent conditional: 119, independent unconditional: 793, dependent: 840, dependent conditional: 34, dependent unconditional: 807, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1747, independent conditional: 268, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1248, unknown conditional: 41, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1213, Positive conditional cache size: 38, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1248, independent: 1213, independent conditional: 38, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1248, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 35, independent conditional: 6, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, independent: 911, independent conditional: 119, independent unconditional: 793, dependent: 840, dependent conditional: 34, dependent unconditional: 807, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1747, independent conditional: 268, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1248, unknown conditional: 41, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1213, Positive conditional cache size: 38, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371 ], Independence queries for same thread: 125 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\old(argc)=3, \old(argv)={50:53}, argc=3, data1Lock={-3:0}, data1Value=0, data2Lock={-2:0}, data2Value=0, err=0, i=0, iRThreads=1, iTThreads=1, rPool={5:0}, tPool={6:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\old(argc)=3, \old(argv)={50:53}, \old(param)={0:0}, argc=3, data1Lock={-3:0}, data1Value=0, data2Lock={-2:0}, data2Value=0, err=0, i=0, iRThreads=1, iTThreads=1, rPool={5:0}, tPool={6:0}] [L1245] 1 int t1 = -1; VAL [\old(param)={0:0}, data1Lock={-3:0}, data1Value=0, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, t1=1] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\old(argc)=3, \old(argv)={50:53}, \old(param)={0:0}, argc=3, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, err=0, i=1, iRThreads=1, iTThreads=1, param={0:0}, rPool={5:0}, t1=1, tPool={6:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\old(argc)=3, \old(argv)={50:53}, \old(param)={0:0}, argc=3, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, err=0, i=0, iRThreads=1, iTThreads=1, param={0:0}, rPool={5:0}, t1=1, tPool={6:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\old(argc)=3, \old(argv)={50:53}, \old(param)={0:0}, \old(param)={0:0}, argc=3, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, err=0, i=0, iRThreads=1, iTThreads=1, param={0:0}, rPool={5:0}, t1=1, tPool={6:0}] [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=0, iRThreads=1, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=2, iRThreads=1, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\old(param)={0:0}, \old(param)={0:0}, \result={0:0}, data1Lock={-3:0}, data1Value=1, data2Lock={-2:0}, data2Value=2, iRThreads=1, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 80 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 11, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/3 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-19 05:53:44,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-19 05:53:44,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 05:53:46,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 05:53:46,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-19 05:53:46,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 05:53:46,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 05:53:46,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 05:53:46,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 05:53:46,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 05:53:46,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 05:53:46,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 05:53:46,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 05:53:46,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 05:53:46,797 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 05:53:46,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 05:53:46,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 05:53:46,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 05:53:46,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 05:53:46,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 05:53:46,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 05:53:46,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 05:53:46,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 05:53:46,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-19 05:53:46,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 05:53:46,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-19 05:53:46,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 05:53:46,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 05:53:46,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 05:53:46,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 05:53:46,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 05:53:46,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 05:53:46,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 05:53:46,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:53:46,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 05:53:46,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 05:53:46,806 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 05:53:46,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-19 05:53:46,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 05:53:46,807 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 05:53:46,808 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-19 05:53:46,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 05:53:46,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-19 05:53:46,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 05:53:46,810 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 05:53:46,810 INFO L153 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 05:53:47,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 05:53:47,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 05:53:47,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 05:53:47,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 05:53:47,203 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 05:53:47,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/twostage_3.i [2024-10-19 05:53:48,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 05:53:49,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 05:53:49,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i [2024-10-19 05:53:49,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b05cb8005/96db6f64443b416089fa80b1508eb51b/FLAGfc6e50cc2 [2024-10-19 05:53:49,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b05cb8005/96db6f64443b416089fa80b1508eb51b [2024-10-19 05:53:49,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 05:53:49,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 05:53:49,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 05:53:49,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 05:53:49,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 05:53:49,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:53:49" (1/1) ... [2024-10-19 05:53:49,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583e3c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:49, skipping insertion in model container [2024-10-19 05:53:49,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:53:49" (1/1) ... [2024-10-19 05:53:49,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 05:53:49,812 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2024-10-19 05:53:49,842 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:49,843 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:49,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:53:49,859 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 05:53:49,906 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2024-10-19 05:53:49,914 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:49,915 WARN L1659 CHandler]: Possible shadowing of function lock [2024-10-19 05:53:49,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:53:50,008 INFO L204 MainTranslator]: Completed translation [2024-10-19 05:53:50,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50 WrapperNode [2024-10-19 05:53:50,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 05:53:50,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 05:53:50,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 05:53:50,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 05:53:50,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,071 INFO L138 Inliner]: procedures = 376, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2024-10-19 05:53:50,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 05:53:50,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 05:53:50,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 05:53:50,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 05:53:50,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 05:53:50,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 05:53:50,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 05:53:50,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 05:53:50,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (1/1) ... [2024-10-19 05:53:50,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:53:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:53:50,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-19 05:53:50,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-19 05:53:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-19 05:53:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2024-10-19 05:53:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2024-10-19 05:53:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2024-10-19 05:53:50,208 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 05:53:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-19 05:53:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 05:53:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 05:53:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 05:53:50,211 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 05:53:50,389 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 05:53:50,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 05:53:50,768 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 05:53:50,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 05:53:51,053 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 05:53:51,054 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 05:53:51,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:51 BoogieIcfgContainer [2024-10-19 05:53:51,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 05:53:51,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 05:53:51,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 05:53:51,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 05:53:51,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 05:53:49" (1/3) ... [2024-10-19 05:53:51,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd7ac83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:53:51, skipping insertion in model container [2024-10-19 05:53:51,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:53:50" (2/3) ... [2024-10-19 05:53:51,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd7ac83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:53:51, skipping insertion in model container [2024-10-19 05:53:51,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:51" (3/3) ... [2024-10-19 05:53:51,066 INFO L112 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2024-10-19 05:53:51,084 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 05:53:51,085 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 05:53:51,085 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 05:53:51,151 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 05:53:51,200 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 05:53:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 05:53:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:53:51,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 05:53:51,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-19 05:53:51,323 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 05:53:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:51,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread1of1ForFork1 ======== [2024-10-19 05:53:51,356 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@10958150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 05:53:51,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 05:53:52,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:52,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1128641970, now seen corresponding path program 1 times [2024-10-19 05:53:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 05:53:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530053233] [2024-10-19 05:53:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:53:52,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 05:53:52,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 05:53:52,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-19 05:53:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:53:52,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-19 05:53:52,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:53:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:53:52,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 05:53:52,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 05:53:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530053233] [2024-10-19 05:53:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530053233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 05:53:52,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 05:53:52,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-19 05:53:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514537521] [2024-10-19 05:53:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 05:53:52,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 05:53:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 05:53:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 05:53:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-19 05:53:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:52,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:53:52,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:53:52,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:54,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-19 05:53:54,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:54,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:54,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2070431758, now seen corresponding path program 2 times [2024-10-19 05:53:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 05:53:54,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474798981] [2024-10-19 05:53:54,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 05:53:54,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:54,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 05:53:54,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 05:53:54,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-19 05:53:54,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 05:53:54,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:53:54,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-19 05:53:54,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:53:54,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-19 05:53:54,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-19 05:53:54,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-19 05:53:54,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-19 05:53:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:53:54,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-19 05:53:54,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-19 05:53:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474798981] [2024-10-19 05:53:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474798981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 05:53:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 05:53:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 05:53:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914694018] [2024-10-19 05:53:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 05:53:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 05:53:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-19 05:53:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 05:53:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 05:53:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:54,547 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:53:54,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:53:54,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:54,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:53:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 05:53:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 05:53:55,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-19 05:53:55,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:55,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 05:53:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:53:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -671539190, now seen corresponding path program 3 times [2024-10-19 05:53:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-19 05:53:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335961968] [2024-10-19 05:53:55,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 05:53:55,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-19 05:53:55,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-19 05:53:55,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-19 05:53:55,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-19 05:53:55,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-19 05:53:55,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 05:53:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 05:53:55,551 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-19 05:53:55,552 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 05:53:55,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 05:53:55,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-19 05:53:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-19 05:53:55,764 INFO L414 BasicCegarLoop]: Path program histogram: [3] [2024-10-19 05:53:55,766 INFO L312 ceAbstractionStarter]: Result for error location funcBThread1of1ForFork1 was UNSAFE (1/2) [2024-10-19 05:53:55,834 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-19 05:53:55,834 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-19 05:53:55,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 05:53:55 BasicIcfg [2024-10-19 05:53:55,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-19 05:53:55,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-19 05:53:55,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-19 05:53:55,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-19 05:53:55,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:53:51" (3/4) ... [2024-10-19 05:53:55,841 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-19 05:53:55,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-19 05:53:55,842 INFO L158 Benchmark]: Toolchain (without parser) took 6701.80ms. Allocated memory was 56.6MB in the beginning and 134.2MB in the end (delta: 77.6MB). Free memory was 25.8MB in the beginning and 48.1MB in the end (delta: -22.3MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,842 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 05:53:55,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 867.65ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 25.7MB in the beginning and 35.9MB in the end (delta: -10.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.50ms. Allocated memory is still 75.5MB. Free memory was 35.9MB in the beginning and 33.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,844 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 75.5MB. Free memory was 33.0MB in the beginning and 30.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,844 INFO L158 Benchmark]: RCFGBuilder took 926.14ms. Allocated memory is still 75.5MB. Free memory was 30.5MB in the beginning and 24.1MB in the end (delta: 6.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,844 INFO L158 Benchmark]: TraceAbstraction took 4781.17ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 23.1MB in the beginning and 48.1MB in the end (delta: -25.0MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2024-10-19 05:53:55,845 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 134.2MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-19 05:53:55,847 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 867.65ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 25.7MB in the beginning and 35.9MB in the end (delta: -10.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.50ms. Allocated memory is still 75.5MB. Free memory was 35.9MB in the beginning and 33.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 75.5MB. Free memory was 33.0MB in the beginning and 30.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 926.14ms. Allocated memory is still 75.5MB. Free memory was 30.5MB in the beginning and 24.1MB in the end (delta: 6.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4781.17ms. Allocated memory was 75.5MB in the beginning and 134.2MB in the end (delta: 58.7MB). Free memory was 23.1MB in the beginning and 48.1MB in the end (delta: -25.0MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 134.2MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 164, dependent conditional: 132, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1226, independent: 1191, independent conditional: 16, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1226, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2073, independent: 1101, independent conditional: 138, independent unconditional: 963, dependent: 972, dependent conditional: 44, dependent unconditional: 927, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1769, independent conditional: 290, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1226, unknown conditional: 19, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1191, Positive conditional cache size: 16, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1226, independent: 1191, independent conditional: 16, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1226, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2073, independent: 1101, independent conditional: 138, independent unconditional: 963, dependent: 972, dependent conditional: 44, dependent unconditional: 927, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1769, independent conditional: 290, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1226, unknown conditional: 19, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1191, Positive conditional cache size: 16, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371 ], Independence queries for same thread: 125, Persistent sets #1 benchmarks: Persistent set computation time: 1.9s, Number of persistent set computation: 220, Number of trivial persistent sets: 173, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1297, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3124, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 164, dependent conditional: 132, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2999, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 39, dependent conditional: 7, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1226, independent: 1191, independent conditional: 16, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1226, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2073, independent: 1101, independent conditional: 138, independent unconditional: 963, dependent: 972, dependent conditional: 44, dependent unconditional: 927, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1769, independent conditional: 290, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1226, unknown conditional: 19, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1191, Positive conditional cache size: 16, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 1660, independent unconditional: 1300, dependent: 85, dependent conditional: 21, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3045, independent: 2960, independent conditional: 306, independent unconditional: 2654, dependent: 85, dependent conditional: 4, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1226, independent: 1191, independent conditional: 16, independent unconditional: 1175, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1226, independent: 1158, independent conditional: 0, independent unconditional: 1158, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 35, dependent conditional: 3, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2073, independent: 1101, independent conditional: 138, independent unconditional: 963, dependent: 972, dependent conditional: 44, dependent unconditional: 927, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3045, independent: 1769, independent conditional: 290, independent unconditional: 1479, dependent: 50, dependent conditional: 1, dependent unconditional: 49, unknown: 1226, unknown conditional: 19, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1191, Positive conditional cache size: 16, Positive unconditional cache size: 1175, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371 ], Independence queries for same thread: 125 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\old(argc)=3, \old(argv)={7:5}, argc=3, data1Lock={3:0}, data1Value=0, data2Lock={6:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={15:0}, tPool={23:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\old(argc)=3, \old(argv)={7:5}, \old(param)={0:0}, argc=3, data1Lock={3:0}, data1Value=0, data2Lock={6:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={15:0}, tPool={23:0}] [L1245] 1 int t1 = -1; VAL [\old(param)={0:0}, data1Lock={3:0}, data1Value=0, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\old(argc)=3, \old(argv)={7:5}, \old(param)={0:0}, argc=3, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={15:0}, t1=1, tPool={23:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\old(argc)=3, \old(argv)={7:5}, \old(param)={0:0}, argc=3, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={15:0}, t1=1, tPool={23:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\old(argc)=3, \old(argv)={7:5}, \old(param)={0:0}, \old(param)={0:0}, argc=3, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={15:0}, t1=1, tPool={23:0}] [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\old(param)={0:0}, \old(param)={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\old(param)={0:0}, \old(param)={0:0}, \result={0:0}, data1Lock={3:0}, data1Value=1, data2Lock={6:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 80 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 4 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 0.0s, ConditionalCommutativityCheckTime: 0.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-19 05:53:55,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-19 05:53:56,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample