/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:31:48,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:31:48,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:31:48,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:31:48,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:31:48,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:31:48,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:31:48,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:31:48,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:31:48,911 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:31:48,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:31:48,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:31:48,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:31:48,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:31:48,913 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:31:48,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:31:48,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:31:48,914 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:31:48,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:31:48,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:31:48,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:31:48,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:31:48,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:31:48,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:31:48,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:31:48,915 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:31:48,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:31:48,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:31:48,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:31:48,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:31:48,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:31:48,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:31:48,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:31:48,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:31:48,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:31:48,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:31:48,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:31:48,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:31:48,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:31:49,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:31:49,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:31:49,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:31:49,170 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:31:49,172 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:31:49,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-21 03:31:50,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:31:50,533 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:31:50,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-21 03:31:50,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa78839e/9d4ea5b748ff4b7aa84ac65fb2778ba9/FLAG33a7724ee [2023-12-21 03:31:50,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa78839e/9d4ea5b748ff4b7aa84ac65fb2778ba9 [2023-12-21 03:31:50,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:31:50,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:31:50,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:31:50,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:31:50,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:31:50,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:31:50" (1/1) ... [2023-12-21 03:31:50,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f186951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:50, skipping insertion in model container [2023-12-21 03:31:50,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:31:50" (1/1) ... [2023-12-21 03:31:50,633 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:31:50,908 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-21 03:31:50,915 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-21 03:31:50,919 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-21 03:31:50,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:31:50,938 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:31:50,978 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-21 03:31:50,979 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-21 03:31:50,979 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-21 03:31:50,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:31:51,010 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:31:51,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51 WrapperNode [2023-12-21 03:31:51,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:31:51,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:31:51,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:31:51,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:31:51,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,053 INFO L138 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 139 [2023-12-21 03:31:51,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:31:51,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:31:51,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:31:51,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:31:51,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,102 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2023-12-21 03:31:51,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:31:51,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:31:51,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:31:51,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:31:51,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (1/1) ... [2023-12-21 03:31:51,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:31:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:31:51,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 03:31:51,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 03:31:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-12-21 03:31:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-12-21 03:31:51,225 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:31:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-12-21 03:31:51,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:31:51,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-12-21 03:31:51,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-12-21 03:31:51,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:31:51,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:31:51,351 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:31:51,353 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:31:51,553 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:31:51,637 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:31:51,637 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 03:31:51,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:31:51 BoogieIcfgContainer [2023-12-21 03:31:51,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:31:51,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:31:51,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:31:51,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:31:51,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:31:50" (1/3) ... [2023-12-21 03:31:51,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b169c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:31:51, skipping insertion in model container [2023-12-21 03:31:51,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:31:51" (2/3) ... [2023-12-21 03:31:51,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b169c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:31:51, skipping insertion in model container [2023-12-21 03:31:51,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:31:51" (3/3) ... [2023-12-21 03:31:51,644 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2023-12-21 03:31:51,655 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:31:51,656 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-21 03:31:51,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:31:51,692 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@13728a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:31:51,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-21 03:31:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 03:31:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 03:31:51,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:31:51,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:31:51,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:31:51,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:31:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1726020281, now seen corresponding path program 1 times [2023-12-21 03:31:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:31:51,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835015431] [2023-12-21 03:31:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:31:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:31:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:31:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:31:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:31:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835015431] [2023-12-21 03:31:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835015431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:31:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:31:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:31:51,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449186453] [2023-12-21 03:31:51,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:31:51,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:31:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:31:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:31:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:31:52,010 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:31:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:31:52,141 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2023-12-21 03:31:52,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:31:52,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-21 03:31:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:31:52,150 INFO L225 Difference]: With dead ends: 102 [2023-12-21 03:31:52,151 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 03:31:52,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:31:52,158 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:31:52,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:31:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 03:31:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-12-21 03:31:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 03:31:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-21 03:31:52,191 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2023-12-21 03:31:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:31:52,191 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-21 03:31:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 03:31:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-21 03:31:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 03:31:52,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:31:52,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:31:52,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:31:52,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:31:52,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:31:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1711785163, now seen corresponding path program 1 times [2023-12-21 03:31:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:31:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285289632] [2023-12-21 03:31:52,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:31:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:31:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:31:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:31:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:31:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285289632] [2023-12-21 03:31:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285289632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:31:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:31:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 03:31:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688731176] [2023-12-21 03:31:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:31:52,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:31:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:31:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:31:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:31:52,687 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:31:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:31:53,131 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2023-12-21 03:31:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 03:31:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-21 03:31:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:31:53,138 INFO L225 Difference]: With dead ends: 147 [2023-12-21 03:31:53,138 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 03:31:53,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-21 03:31:53,141 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 115 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:31:53,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 160 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 03:31:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 03:31:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2023-12-21 03:31:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 58 states have internal predecessors, (65), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-21 03:31:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-12-21 03:31:53,171 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 24 [2023-12-21 03:31:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:31:53,172 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-12-21 03:31:53,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:31:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-12-21 03:31:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 03:31:53,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:31:53,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:31:53,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:31:53,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:31:53,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:31:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 137181858, now seen corresponding path program 1 times [2023-12-21 03:31:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:31:53,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143286076] [2023-12-21 03:31:53,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:31:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:31:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:31:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:31:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:31:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143286076] [2023-12-21 03:31:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143286076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:31:53,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:31:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 03:31:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548617534] [2023-12-21 03:31:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:31:53,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 03:31:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:31:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 03:31:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 03:31:53,261 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:31:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:31:53,377 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2023-12-21 03:31:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:31:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-12-21 03:31:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:31:53,379 INFO L225 Difference]: With dead ends: 87 [2023-12-21 03:31:53,379 INFO L226 Difference]: Without dead ends: 85 [2023-12-21 03:31:53,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:31:53,381 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:31:53,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:31:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-21 03:31:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2023-12-21 03:31:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2023-12-21 03:31:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2023-12-21 03:31:53,393 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 24 [2023-12-21 03:31:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:31:53,393 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2023-12-21 03:31:53,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-21 03:31:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2023-12-21 03:31:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 03:31:53,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:31:53,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:31:53,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 03:31:53,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:31:53,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:31:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1808531088, now seen corresponding path program 1 times [2023-12-21 03:31:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:31:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404444270] [2023-12-21 03:31:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:31:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:31:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:31:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 03:31:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 03:31:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 03:31:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 03:31:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-21 03:31:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:31:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404444270] [2023-12-21 03:31:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404444270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:31:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140450694] [2023-12-21 03:31:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:53,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:31:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:31:53,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:31:53,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:31:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:53,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 03:31:53,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:31:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:31:53,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:31:53,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140450694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:31:53,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:31:53,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2023-12-21 03:31:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521658558] [2023-12-21 03:31:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:31:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:31:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:31:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:31:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:31:53,837 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 03:31:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:31:53,903 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2023-12-21 03:31:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:31:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2023-12-21 03:31:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:31:53,905 INFO L225 Difference]: With dead ends: 143 [2023-12-21 03:31:53,905 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 03:31:53,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 03:31:53,907 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:31:53,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:31:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 03:31:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 03:31:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2023-12-21 03:31:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2023-12-21 03:31:53,917 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 55 [2023-12-21 03:31:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:31:53,917 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2023-12-21 03:31:53,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 03:31:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2023-12-21 03:31:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 03:31:53,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:31:53,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:31:53,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 03:31:54,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:31:54,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:31:54,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:31:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1360828121, now seen corresponding path program 2 times [2023-12-21 03:31:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:31:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840036027] [2023-12-21 03:31:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:31:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:31:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 03:31:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 03:31:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:31:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 03:31:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 03:31:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 03:31:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 03:31:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:31:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 03:31:56,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:31:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840036027] [2023-12-21 03:31:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840036027] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:31:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040071629] [2023-12-21 03:31:56,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:31:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:31:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:31:56,928 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:31:56,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:31:57,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:31:57,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:31:57,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 148 conjunts are in the unsatisfiable core [2023-12-21 03:31:57,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:31:57,399 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:31:57,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:31:57,614 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-12-21 03:31:57,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-12-21 03:31:59,045 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-12-21 03:31:59,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2023-12-21 03:31:59,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:31:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:31:59,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:31:59,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-21 03:32:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:32:00,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 03:32:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 86 [2023-12-21 03:32:00,196 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 5 treesize of output 3 [2023-12-21 03:32:00,229 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-21 03:32:00,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 53 [2023-12-21 03:32:58,126 WARN L293 SmtUtils]: Spent 52.39s on a formula simplification. DAG size of input: 285 DAG size of output: 276 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 03:33:02,919 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#mutexes~0.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse7 (select .cse5 0))) (let ((.cse8 (store (select |c_old(#memory_$Pointer$#1.base)| .cse7) 0 |c_mutex_lock_#in~m#1.base|))) (let ((.cse47 (store |c_old(#memory_$Pointer$#1.base)| .cse7 .cse8))) (let ((.cse45 (select (select .cse47 3) 0))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) 8)) (.cse11 (not (= .cse7 3))) (.cse12 (= (select |c_old(#valid)| .cse7) 0)) (.cse10 (= .cse45 3)) (.cse26 (= (select |c_old(#valid)| 3) 0)) (.cse43 (select |c_old(#memory_$Pointer$#1.base)| 3)) (.cse29 (select .cse5 8)) (.cse23 (= (select (select |c_#memory_$Pointer$#1.offset| 3) 0) 4)) (.cse25 (= |c_mutex_lock_#in~m#1.base| 3))) (or (and (or (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse2 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse3 (select .cse2 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse1 (let ((.cse4 (+ __ldv_list_add_~next.offset 4))) (store .cse3 .cse4 (select .cse5 .cse4))))) (let ((.cse0 (store (store (select (store .cse2 3 .cse1) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse0) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse1) |mutex_lock_ldv_list_add_~new#1.base| .cse0) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))) (= (select .cse3 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)))))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse8 4 3) 8 .cse9)))) (store .cse6 3 (store (select .cse6 3) 0 .cse7)))) .cse10 .cse11 .cse12) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse16 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse13 (select .cse16 3))) (and (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse13 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3)) (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= (let ((.cse15 (let ((.cse17 (+ __ldv_list_add_~next.offset 4))) (store .cse13 .cse17 (select .cse5 .cse17))))) (let ((.cse14 (store (store (select (store .cse16 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse15) |mutex_lock_ldv_list_add_~new#1.base| .cse14) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|))))))) (exists ((|mutex_lock_ldv_list_add_~new#1.base| Int)) (let ((.cse20 (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base|) 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select .cse20 3))) (and (exists ((__ldv_list_add_~next.offset Int)) (= (let ((.cse19 (let ((.cse22 (+ __ldv_list_add_~next.offset 4))) (store .cse21 .cse22 (select .cse5 .cse22))))) (let ((.cse18 (store (store (select (store .cse20 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base|) 4 3) 8 (select (select |c_#memory_$Pointer$#1.base| |mutex_lock_ldv_list_add_~new#1.base|) 8)))) (store (store |c_old(#memory_$Pointer$#1.base)| |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3 (store (select (store (store |c_old(#memory_$Pointer$#1.base)| 3 .cse19) |mutex_lock_ldv_list_add_~new#1.base| .cse18) 3) 0 |mutex_lock_ldv_list_add_~new#1.base|)))) |c_#memory_$Pointer$#1.base|)) (= (select |c_old(#valid)| |mutex_lock_ldv_list_add_~new#1.base|) 0) (= (select .cse21 0) 3) (not (= |mutex_lock_ldv_list_add_~new#1.base| 3))))))) .cse23) (let ((.cse24 (select |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base|))) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (and (= .cse24 (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_4) 3 v_DerPreprocessor_5) |c_mutex_lock_#in~m#1.base|)) (= (select v_DerPreprocessor_5 0) 4))) (not .cse25) .cse26 .cse23 (exists ((v_DerPreprocessor_13 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$#1.offset| |c_mutex_lock_#in~m#1.base| v_DerPreprocessor_13) 3 (store .cse24 0 4)) |c_mutex_lock_#in~m#1.base|) .cse24)) (let ((.cse28 (store |c_old(#memory_$Pointer$#1.base)| 3 (store .cse43 0 |c_mutex_lock_#in~m#1.base|)))) (let ((.cse30 (select .cse28 |c_mutex_lock_#in~m#1.base|)) (.cse32 (select |c_#memory_$Pointer$#1.base| |c_mutex_lock_#in~m#1.base|))) (or (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse27 (let ((.cse31 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse31 (select .cse32 .cse31))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse27) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse27) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse33 (let ((.cse34 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse34 (select .cse32 .cse34))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse33) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse33) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse36 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse35 (store .cse30 .cse36 (select .cse32 .cse36)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse35) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse35) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse36 0))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse38 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse37 (store .cse30 .cse38 (select .cse32 .cse38)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse37) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse37) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= __ldv_list_add_~next.offset 4)) (not (= .cse38 0))))) (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse39 (let ((.cse40 (+ __ldv_list_add_~next.offset 4))) (store .cse30 .cse40 (select .cse32 .cse40))))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse39) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse39) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3))))) (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse42 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse41 (store .cse30 .cse42 (select .cse32 .cse42)))) (store (store |c_old(#memory_$Pointer$#1.base)| |c_mutex_lock_#in~m#1.base| .cse41) 3 (store (store (store (select (store .cse28 |c_mutex_lock_#in~m#1.base| .cse41) 3) 4 |c_mutex_lock_#in~m#1.base|) 8 .cse29) 0 3)))) (not (= .cse42 0)))))))))) (and (let ((.cse76 (select |c_#memory_$Pointer$#1.offset| .cse7))) (let ((.cse71 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse80 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (and (= (select v_DerPreprocessor_12 0) 4) (= v_DerPreprocessor_10 (select .cse80 .cse45)) (= .cse76 (select .cse80 .cse7)))))) (.cse70 (select |c_#memory_$Pointer$#1.offset| .cse45)) (.cse68 (= .cse45 .cse7))) (let ((.cse51 (not .cse68)) (.cse53 (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse78 (select .cse79 .cse45))) (and (= v_DerPreprocessor_12 (store .cse78 0 4)) (= .cse78 .cse70) (= .cse76 (select .cse79 .cse7))))))) (.cse48 (select .cse47 .cse45)) (.cse50 (select |c_#memory_$Pointer$#1.base| .cse45)) (.cse57 (or (and .cse71 .cse68) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse77 (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12))) (let ((.cse75 (select .cse77 .cse45))) (and (= v_DerPreprocessor_12 (store .cse75 0 4)) (= v_DerPreprocessor_10 .cse75) (= .cse75 .cse70) (= .cse76 (select .cse77 .cse7)))))))) (.cse52 (not .cse10))) (or (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse44 (let ((.cse46 (let ((.cse49 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse49 (select .cse50 .cse49))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse46) .cse7 (store (store (select (store .cse47 .cse45 .cse46) .cse7) 4 .cse45) 8 .cse9))))) (store .cse44 3 (store (select .cse44 3) 0 .cse7)))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse54 (let ((.cse55 (let ((.cse56 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse56 (select .cse50 .cse56))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse55) .cse7 (store (store (select (store .cse47 .cse45 .cse55) .cse7) 4 .cse45) 8 .cse9))))) (store .cse54 3 (store (select .cse54 3) 0 .cse7)))))) .cse11 .cse57 .cse52 .cse12) (and .cse11 .cse51 .cse52 (exists ((__ldv_list_add_~next.offset Int)) (= |c_#memory_$Pointer$#1.base| (let ((.cse58 (let ((.cse59 (let ((.cse60 (+ __ldv_list_add_~next.offset 4))) (store .cse48 .cse60 (select .cse50 .cse60))))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse59) .cse7 (store (store (select (store .cse47 .cse45 .cse59) .cse7) 4 .cse45) 8 .cse9))))) (store .cse58 3 (store (select .cse58 3) 0 .cse7))))) .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse63 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse61 (let ((.cse62 (store .cse48 .cse63 (select .cse50 .cse63)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse62) .cse7 (store (store (select (store .cse47 .cse45 .cse62) .cse7) 4 .cse45) 8 .cse9))))) (store .cse61 3 (store (select .cse61 3) 0 .cse7)))) (not (= .cse63 0))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse66 (+ __ldv_list_add_~next.offset 4))) (and (= |c_#memory_$Pointer$#1.base| (let ((.cse64 (let ((.cse65 (store .cse48 .cse66 (select .cse50 .cse66)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse65) .cse7 (store (store (select (store .cse47 .cse45 .cse65) .cse7) 4 .cse45) 8 .cse9))))) (store .cse64 3 (store (select .cse64 3) 0 .cse7)))) (not (= .cse66 0))))) .cse11 .cse51 .cse52 .cse12 .cse53) (and (= (let ((.cse67 (store |c_old(#memory_$Pointer$#1.base)| .cse7 (store (store .cse8 4 .cse45) 8 .cse9)))) (store .cse67 3 (store (select .cse67 3) 0 .cse7))) |c_#memory_$Pointer$#1.base|) .cse11 .cse68 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse45 v_DerPreprocessor_10) .cse7 v_DerPreprocessor_11) 3 v_DerPreprocessor_12) .cse45))) (and (= v_DerPreprocessor_12 (store .cse69 0 4)) (= v_DerPreprocessor_10 .cse69) (= .cse69 .cse70)))) .cse71) .cse12) (and (exists ((__ldv_list_add_~next.offset Int)) (let ((.cse74 (+ __ldv_list_add_~next.offset 4))) (and (not (= __ldv_list_add_~next.offset 0)) (not (= __ldv_list_add_~next.offset 4)) (= |c_#memory_$Pointer$#1.base| (let ((.cse72 (let ((.cse73 (store .cse48 .cse74 (select .cse50 .cse74)))) (store (store |c_old(#memory_$Pointer$#1.base)| .cse45 .cse73) .cse7 (store (store (select (store .cse47 .cse45 .cse73) .cse7) 4 .cse45) 8 .cse9))))) (store .cse72 3 (store (select .cse72 3) 0 .cse7)))) (not (= .cse74 0))))) .cse11 .cse57 .cse52 .cse12))))) .cse23) (and .cse26 (or (exists ((__ldv_list_add_~next.offset Int)) (= (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store (let ((.cse81 (+ __ldv_list_add_~next.offset 4))) (store .cse43 .cse81 (select .cse5 .cse81))) 4 3) 8 .cse29) 0 3)) |c_#memory_$Pointer$#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| 3 (store (store (store .cse43 4 3) 8 .cse29) 0 3)))) .cse23 .cse25)))))))) (= 3 |c_~#mutexes~0.base|)) is different from false [2023-12-21 03:34:51,269 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 224 DAG size of output: 218 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 03:34:52,243 INFO L190 IndexEqualityManager]: detected not equals via solver Received shutdown request... [2023-12-21 03:46:26,069 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 03:46:26,069 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 03:46:27,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:46:27,270 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 03:46:27,283 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:46:27,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:46:27,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-21 03:46:27,284 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-12-21 03:46:27,288 INFO L158 Benchmark]: Toolchain (without parser) took 876723.16ms. Allocated memory was 320.9MB in the beginning and 511.7MB in the end (delta: 190.8MB). Free memory was 257.5MB in the beginning and 435.7MB in the end (delta: -178.1MB). Peak memory consumption was 285.3MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,288 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 135.8MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:46:27,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.66ms. Allocated memory is still 320.9MB. Free memory was 257.5MB in the beginning and 237.2MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.19ms. Allocated memory is still 320.9MB. Free memory was 237.2MB in the beginning and 234.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,289 INFO L158 Benchmark]: Boogie Preprocessor took 80.28ms. Allocated memory is still 320.9MB. Free memory was 234.8MB in the beginning and 229.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,289 INFO L158 Benchmark]: RCFGBuilder took 501.82ms. Allocated memory is still 320.9MB. Free memory was 229.2MB in the beginning and 260.7MB in the end (delta: -31.4MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,290 INFO L158 Benchmark]: TraceAbstraction took 875648.48ms. Allocated memory was 320.9MB in the beginning and 511.7MB in the end (delta: 190.8MB). Free memory was 260.1MB in the beginning and 435.7MB in the end (delta: -175.5MB). Peak memory consumption was 287.6MB. Max. memory is 8.0GB. [2023-12-21 03:46:27,291 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.12ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 135.8MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.66ms. Allocated memory is still 320.9MB. Free memory was 257.5MB in the beginning and 237.2MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.19ms. Allocated memory is still 320.9MB. Free memory was 237.2MB in the beginning and 234.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.28ms. Allocated memory is still 320.9MB. Free memory was 234.8MB in the beginning and 229.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 501.82ms. Allocated memory is still 320.9MB. Free memory was 229.2MB in the beginning and 260.7MB in the end (delta: -31.4MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * TraceAbstraction took 875648.48ms. Allocated memory was 320.9MB in the beginning and 511.7MB in the end (delta: 190.8MB). Free memory was 260.1MB in the beginning and 435.7MB in the end (delta: -175.5MB). Peak memory consumption was 287.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown