./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 00:38:28,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 00:38:28,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-13 00:38:28,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 00:38:28,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 00:38:28,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 00:38:28,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 00:38:28,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 00:38:28,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 00:38:28,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 00:38:28,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 00:38:28,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 00:38:28,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 00:38:28,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 00:38:28,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 00:38:28,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 00:38:28,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 00:38:28,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 00:38:28,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 00:38:28,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 00:38:28,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 00:38:28,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 00:38:28,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 00:38:28,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 00:38:28,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 00:38:28,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 00:38:28,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 00:38:28,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 00:38:28,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 00:38:28,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 00:38:28,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 00:38:28,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 00:38:28,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 00:38:28,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 00:38:28,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 00:38:28,179 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 00:38:28,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 00:38:28,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 00:38:28,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 00:38:28,180 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 00:38:28,181 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 00:38:28,182 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-11-13 00:38:28,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 00:38:28,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 00:38:28,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 00:38:28,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 00:38:28,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 00:38:28,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-13 00:38:29,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 00:38:30,248 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 00:38:30,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-13 00:38:30,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0ecc2cdad/9e4c0ae8b38d43f69e5e4b8e4dc5e2a1/FLAGdf1ee853d [2024-11-13 00:38:30,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0ecc2cdad/9e4c0ae8b38d43f69e5e4b8e4dc5e2a1 [2024-11-13 00:38:30,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 00:38:30,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 00:38:30,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 00:38:30,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 00:38:30,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 00:38:30,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:38:30" (1/1) ... [2024-11-13 00:38:30,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce648e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:30, skipping insertion in model container [2024-11-13 00:38:30,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:38:30" (1/1) ... [2024-11-13 00:38:30,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 00:38:30,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-13 00:38:31,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 00:38:31,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 00:38:31,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-13 00:38:31,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 00:38:31,360 INFO L204 MainTranslator]: Completed translation [2024-11-13 00:38:31,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31 WrapperNode [2024-11-13 00:38:31,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 00:38:31,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 00:38:31,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 00:38:31,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 00:38:31,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,417 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2024-11-13 00:38:31,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 00:38:31,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 00:38:31,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 00:38:31,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 00:38:31,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 00:38:31,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 00:38:31,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 00:38:31,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 00:38:31,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (1/1) ... [2024-11-13 00:38:31,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 00:38:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:38:31,509 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-11-13 00:38:31,514 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-11-13 00:38:31,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 00:38:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 00:38:31,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-13 00:38:31,564 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-13 00:38:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 00:38:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 00:38:31,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 00:38:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 00:38:31,566 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 00:38:31,687 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 00:38:31,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 00:38:31,838 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 00:38:31,838 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 00:38:32,212 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 00:38:32,215 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 00:38:32,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:38:32 BoogieIcfgContainer [2024-11-13 00:38:32,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 00:38:32,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 00:38:32,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 00:38:32,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 00:38:32,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:38:30" (1/3) ... [2024-11-13 00:38:32,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6dc798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:38:32, skipping insertion in model container [2024-11-13 00:38:32,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:38:31" (2/3) ... [2024-11-13 00:38:32,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6dc798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:38:32, skipping insertion in model container [2024-11-13 00:38:32,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:38:32" (3/3) ... [2024-11-13 00:38:32,225 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-13 00:38:32,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 00:38:32,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-13 00:38:32,245 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 00:38:32,287 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 00:38:32,348 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:38:32,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 00:38:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:38:32,351 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-11-13 00:38:32,352 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-11-13 00:38:32,378 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:38:32,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:38:32,396 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;@6dd4a47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:38:32,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:38:32,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:38:32,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:38:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash 113709350, now seen corresponding path program 1 times [2024-11-13 00:38:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:38:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809334813] [2024-11-13 00:38:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:38:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:38:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:38:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809334813] [2024-11-13 00:38:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809334813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:38:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:38:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:38:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377375128] [2024-11-13 00:38:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:38:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:38:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:38:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:38:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:38:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:33,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:38:33,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-11-13 00:38:33,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:33,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 00:38:33,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:38:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:38:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 898808538, now seen corresponding path program 1 times [2024-11-13 00:38:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:38:33,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776653352] [2024-11-13 00:38:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:38:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:38:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:33,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:38:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776653352] [2024-11-13 00:38:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776653352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 00:38:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326285763] [2024-11-13 00:38:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:33,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 00:38:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:38:33,314 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-11-13 00:38:33,315 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-11-13 00:38:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:38:33,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 00:38:33,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 00:38:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:33,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 00:38:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326285763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 00:38:33,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 00:38:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 00:38:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075930320] [2024-11-13 00:38:33,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 00:38:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 00:38:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:38:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 00:38:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 00:38:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:33,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:38:33,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-11-13 00:38:33,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:33,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 00:38:33,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 00:38:33,937 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-11-13 00:38:33,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:38:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:38:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -47972362, now seen corresponding path program 2 times [2024-11-13 00:38:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:38:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979318907] [2024-11-13 00:38:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:38:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:38:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:38:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979318907] [2024-11-13 00:38:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979318907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 00:38:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408715454] [2024-11-13 00:38:34,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 00:38:34,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 00:38:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:38:34,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 00:38:34,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 00:38:34,409 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 00:38:34,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 00:38:34,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 00:38:34,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 00:38:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:34,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 00:38:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408715454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 00:38:34,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 00:38:34,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 00:38:34,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660808538] [2024-11-13 00:38:34,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 00:38:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 00:38:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:38:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 00:38:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-13 00:38:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:34,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:38:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-11-13 00:38:34,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:34,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 00:38:34,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 00:38:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 00:38:34,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 00:38:35,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 00:38:35,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:38:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:38:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash -421605842, now seen corresponding path program 3 times [2024-11-13 00:38:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:38:35,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234070321] [2024-11-13 00:38:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:38:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:38:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 11 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:38:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234070321] [2024-11-13 00:38:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234070321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 00:38:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235252536] [2024-11-13 00:38:35,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 00:38:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 00:38:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:38:35,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 00:38:35,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 00:38:35,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-13 00:38:35,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 00:38:35,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 00:38:35,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 00:38:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:35,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 00:38:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 0 proven. 431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:38:36,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235252536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 00:38:36,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 00:38:36,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2024-11-13 00:38:36,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998613464] [2024-11-13 00:38:36,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 00:38:36,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 00:38:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:38:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 00:38:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 00:38:36,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:36,373 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:38:36,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.636363636363637) internal successors, (252), 33 states have internal predecessors, (252), 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-11-13 00:38:36,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:36,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 00:38:36,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 00:38:36,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:38:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:38:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 00:38:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 00:38:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 00:38:36,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 00:38:37,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 00:38:37,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:38:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:38:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -817104919, now seen corresponding path program 4 times [2024-11-13 00:38:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:38:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037468525] [2024-11-13 00:38:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:38:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:38:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:38:37,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:38:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:38:37,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:38:37,376 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:38:37,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-13 00:38:37,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-13 00:38:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 00:38:37,387 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-13 00:38:37,560 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 00:38:37,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 00:38:37,584 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-11-13 00:38:37,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:38:37 BasicIcfg [2024-11-13 00:38:37,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 00:38:37,586 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 00:38:37,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 00:38:37,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 00:38:37,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:38:32" (3/4) ... [2024-11-13 00:38:37,587 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 00:38:37,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-11-13 00:38:37,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 00:38:37,696 INFO L158 Benchmark]: Toolchain (without parser) took 7169.34ms. Allocated memory was 148.9MB in the beginning and 257.9MB in the end (delta: 109.1MB). Free memory was 90.0MB in the beginning and 155.8MB in the end (delta: -65.8MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,696 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 00:38:37,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.23ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 89.7MB in the beginning and 159.4MB in the end (delta: -69.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.31ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 156.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,697 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 211.8MB. Free memory was 156.3MB in the beginning and 155.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,697 INFO L158 Benchmark]: RCFGBuilder took 750.14ms. Allocated memory is still 211.8MB. Free memory was 155.2MB in the beginning and 90.2MB in the end (delta: 65.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,697 INFO L158 Benchmark]: TraceAbstraction took 5368.24ms. Allocated memory was 211.8MB in the beginning and 257.9MB in the end (delta: 46.1MB). Free memory was 90.2MB in the beginning and 178.0MB in the end (delta: -87.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,698 INFO L158 Benchmark]: Witness Printer took 109.87ms. Allocated memory is still 257.9MB. Free memory was 178.0MB in the beginning and 155.8MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-13 00:38:37,699 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.28ms. Allocated memory is still 148.9MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 834.23ms. Allocated memory was 148.9MB in the beginning and 211.8MB in the end (delta: 62.9MB). Free memory was 89.7MB in the beginning and 159.4MB in the end (delta: -69.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.31ms. Allocated memory is still 211.8MB. Free memory was 159.4MB in the beginning and 156.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 211.8MB. Free memory was 156.3MB in the beginning and 155.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.14ms. Allocated memory is still 211.8MB. Free memory was 155.2MB in the beginning and 90.2MB in the end (delta: 65.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5368.24ms. Allocated memory was 211.8MB in the beginning and 257.9MB in the end (delta: 46.1MB). Free memory was 90.2MB in the beginning and 178.0MB in the end (delta: -87.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 109.87ms. Allocated memory is still 257.9MB. Free memory was 178.0MB in the beginning and 155.8MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. 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: 848, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 176, dependent conditional: 172, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 680, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 682, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 682, independent: 672, independent conditional: 0, independent unconditional: 672, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 682, independent: 672, independent conditional: 0, independent unconditional: 672, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 682, independent: 602, independent conditional: 0, independent unconditional: 602, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 74, unknown conditional: 0, unknown unconditional: 74] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 588, Maximal queried relation: 1, Independence queries for same thread: 168, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 38, Number of trivial persistent sets: 34, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 848, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 176, dependent conditional: 172, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 680, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 682, independent: 672, independent conditional: 582, independent unconditional: 90, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 682, independent: 672, independent conditional: 0, independent unconditional: 672, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 682, independent: 672, independent conditional: 0, independent unconditional: 672, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 682, independent: 602, independent conditional: 0, independent unconditional: 602, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 74, unknown conditional: 0, unknown unconditional: 74] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 588, Maximal queried relation: 1, Independence queries for same thread: 168 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=0, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, j=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=1, j=1, myglobal=2, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=2, j=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=2, j=3, myglobal=4, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=5] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=3, j=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=3, j=5, myglobal=6, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=7, myglobal=7] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=3, i=4, j=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=4, j=7, myglobal=8, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=7, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=9, myglobal=9] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=4, i=5, j=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=5, j=9, myglobal=10, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=9, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=11, myglobal=11] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=5, i=6, j=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=6, j=11, myglobal=12, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=11, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=13, myglobal=13] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=6, i=7, j=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=7, j=13, myglobal=14, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=13, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=15, myglobal=15] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, i=8, j=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=8, j=15, myglobal=16, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=15, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=17, myglobal=17] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=8, i=9, j=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, i=9, j=17, myglobal=18, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=17, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=19, myglobal=19] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=9, j=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=10, j=19, myglobal=20, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=19, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=21] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=11, j=21, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=11, j=21, myglobal=22, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=21, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=23, myglobal=23] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=12, j=23, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=12, j=23, myglobal=24, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=23, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=25, myglobal=25] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=13, j=25, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=13, j=25, myglobal=26, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=25, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=27, myglobal=27] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=14, j=27, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=14, j=27, myglobal=28, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=27, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=29, myglobal=29] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=15, j=29, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=15, j=29, myglobal=30, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=29, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=31, myglobal=31] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=16, j=31, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=16, j=31, myglobal=32, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=31, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=33, myglobal=33] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=17, j=33, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=17, j=33, myglobal=34, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=33, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=35, myglobal=35] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=18, j=35, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=18, j=35, myglobal=36, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=35, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=37, myglobal=37] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=19, j=37, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=19, j=37, myglobal=38, mythread=-1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=37, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=39, myglobal=39] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=39, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=39, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=39, myglobal=40] - UnprovableResult [Line: 1342]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.0s, 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: 56, 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.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 1348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 33/1549 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-13 00:38:37,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE