/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_93-evilcollapse_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:01:18,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:01:18,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:01:18,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:01:18,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:01:18,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:01:18,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:01:18,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:01:18,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:01:18,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:01:18,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:01:18,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:01:18,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:01:18,147 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:01:18,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:01:18,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:01:18,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:01:18,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:01:18,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:01:18,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:01:18,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:01:18,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:01:18,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:01:18,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:01:18,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:01:18,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:01:18,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:01:18,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:01:18,151 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:01:18,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:01:18,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:01:18,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:01:18,153 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:01:18,154 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:01:18,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 00:01:18,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:01:18,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:01:18,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:01:18,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:01:18,390 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:01:18,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-01-26 00:01:19,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:01:19,781 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:01:19,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2024-01-26 00:01:19,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/75de5c68a/93c778b244a9494ca1ba2ab60040375e/FLAG7376a8fac [2024-01-26 00:01:19,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/75de5c68a/93c778b244a9494ca1ba2ab60040375e [2024-01-26 00:01:19,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:01:19,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:01:19,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:01:19,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:01:19,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:01:19,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:01:19" (1/1) ... [2024-01-26 00:01:19,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50518694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:19, skipping insertion in model container [2024-01-26 00:01:19,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:01:19" (1/1) ... [2024-01-26 00:01:19,868 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:01:20,246 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_93-evilcollapse_racefree.i[47038,47051] [2024-01-26 00:01:20,261 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,262 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,262 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,263 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:01:20,325 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:01:20,357 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_93-evilcollapse_racefree.i[47038,47051] [2024-01-26 00:01:20,359 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,360 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,362 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,363 WARN L1574 CHandler]: Possible shadowing of function new [2024-01-26 00:01:20,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:01:20,447 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:01:20,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20 WrapperNode [2024-01-26 00:01:20,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:01:20,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:01:20,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:01:20,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:01:20,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,513 INFO L138 Inliner]: procedures = 280, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 237 [2024-01-26 00:01:20,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:01:20,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:01:20,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:01:20,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:01:20,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:01:20,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:01:20,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:01:20,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:01:20,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (1/1) ... [2024-01-26 00:01:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:01:20,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:20,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 00:01:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 00:01:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-26 00:01:20,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-26 00:01:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:01:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:01:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:01:20,627 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 00:01:20,789 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:01:20,791 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:01:21,078 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:01:21,115 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:01:21,115 INFO L309 CfgBuilder]: Removed 16 assume(true) statements. [2024-01-26 00:01:21,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:01:21 BoogieIcfgContainer [2024-01-26 00:01:21,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:01:21,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:01:21,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:01:21,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:01:21,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:01:19" (1/3) ... [2024-01-26 00:01:21,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38be5ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:01:21, skipping insertion in model container [2024-01-26 00:01:21,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:01:20" (2/3) ... [2024-01-26 00:01:21,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38be5ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:01:21, skipping insertion in model container [2024-01-26 00:01:21,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:01:21" (3/3) ... [2024-01-26 00:01:21,121 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2024-01-26 00:01:21,127 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:01:21,136 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:01:21,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:01:21,137 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:01:21,212 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-26 00:01:21,256 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:01:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:01:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:21,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 00:01:21,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 00:01:21,303 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:01:21,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-01-26 00:01:21,316 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ebf2b8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:01:21,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:21,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:21,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -294733096, now seen corresponding path program 1 times [2024-01-26 00:01:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411468854] [2024-01-26 00:01:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:21,541 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:21,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304952751] [2024-01-26 00:01:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:21,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:21,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:21,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-26 00:01:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:01:21,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjunts are in the unsatisfiable core [2024-01-26 00:01:21,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:01:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-26 00:01:21,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 00:01:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:01:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411468854] [2024-01-26 00:01:21,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 00:01:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304952751] [2024-01-26 00:01:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304952751] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:01:21,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:01:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:01:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868858801] [2024-01-26 00:01:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:01:21,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:01:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:01:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:01:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:01:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:21,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:01:21,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:01:21,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:21,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-26 00:01:22,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-01-26 00:01:22,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:22,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1069538074, now seen corresponding path program 1 times [2024-01-26 00:01:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:22,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216639335] [2024-01-26 00:01:22,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:22,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:22,125 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:22,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038763088] [2024-01-26 00:01:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:22,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:22,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-26 00:01:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:01:22,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-26 00:01:22,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:01:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 00:01:22,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:01:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 00:01:22,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:01:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216639335] [2024-01-26 00:01:22,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 00:01:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038763088] [2024-01-26 00:01:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038763088] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:01:22,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 00:01:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-01-26 00:01:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734063807] [2024-01-26 00:01:22,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 00:01:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-26 00:01:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:01:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-26 00:01:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-01-26 00:01:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:22,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:01:22,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:01:22,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:22,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:22,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 00:01:22,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:22,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:22,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1472330601, now seen corresponding path program 2 times [2024-01-26 00:01:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603284783] [2024-01-26 00:01:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:22,927 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140978533] [2024-01-26 00:01:22,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 00:01:22,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:22,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:22,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:22,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-26 00:01:23,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 00:01:23,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:01:23,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 00:01:23,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:01:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 00:01:23,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:01:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 1 proven. 220 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-26 00:01:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:01:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603284783] [2024-01-26 00:01:23,776 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 00:01:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140978533] [2024-01-26 00:01:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140978533] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:01:23,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 00:01:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-01-26 00:01:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532055559] [2024-01-26 00:01:23,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 00:01:23,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-26 00:01:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:01:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-26 00:01:23,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-01-26 00:01:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:23,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:01:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.45) internal successors, (369), 20 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:01:23,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:23,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:23,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-26 00:01:24,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-26 00:01:24,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:24,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:24,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 243583249, now seen corresponding path program 3 times [2024-01-26 00:01:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561735498] [2024-01-26 00:01:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:24,501 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092624441] [2024-01-26 00:01:24,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 00:01:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:24,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:24,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:24,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-26 00:01:24,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-26 00:01:24,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:01:24,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-26 00:01:24,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:01:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2024-01-26 00:01:25,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:01:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2024-01-26 00:01:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:01:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561735498] [2024-01-26 00:01:25,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 00:01:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092624441] [2024-01-26 00:01:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092624441] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:01:25,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 00:01:25,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-01-26 00:01:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734091162] [2024-01-26 00:01:25,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 00:01:25,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-26 00:01:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:01:25,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-26 00:01:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-01-26 00:01:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:25,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:01:25,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:01:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-01-26 00:01:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-26 00:01:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:25,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-26 00:01:25,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:25,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:25,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1302208337, now seen corresponding path program 4 times [2024-01-26 00:01:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51794357] [2024-01-26 00:01:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:25,994 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118933827] [2024-01-26 00:01:25,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 00:01:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:26,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:26,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 00:01:27,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 00:01:27,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 00:01:27,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 4437 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 00:01:27,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:01:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13745 backedges. 0 proven. 9500 refuted. 0 times theorem prover too weak. 4245 trivial. 0 not checked. [2024-01-26 00:01:28,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:01:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13745 backedges. 0 proven. 9500 refuted. 0 times theorem prover too weak. 4245 trivial. 0 not checked. [2024-01-26 00:01:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:01:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51794357] [2024-01-26 00:01:29,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-26 00:01:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118933827] [2024-01-26 00:01:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118933827] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:01:29,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-26 00:01:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-01-26 00:01:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047735801] [2024-01-26 00:01:29,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-26 00:01:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-26 00:01:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:01:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-26 00:01:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-01-26 00:01:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:29,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:01:29,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.25) internal successors, (372), 16 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 00:01:29,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:29,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:29,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-01-26 00:01:29,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:29,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-01-26 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-26 00:01:29,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-26 00:01:29,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:29,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-26 00:01:29,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:01:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 358661073, now seen corresponding path program 5 times [2024-01-26 00:01:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:01:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495666317] [2024-01-26 00:01:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:01:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:01:30,024 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-26 00:01:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451080803] [2024-01-26 00:01:30,025 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 00:01:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:01:30,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:01:30,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 00:01:30,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Received shutdown request... [2024-01-26 00:16:03,064 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 00:16:03,064 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 00:16:03,064 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 00:16:04,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-01-26 00:16:04,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2024-01-26 00:16:04,270 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2024-01-26 00:16:04,300 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2024-01-26 00:16:04,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-01-26 00:16:04,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137 [2024-01-26 00:16:04,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-26 00:16:04,304 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 2478 with TraceHistMax 64,while AutomatonFreeRefinementEngine was Timeout during CAMEL. [2024-01-26 00:16:04,309 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1] [2024-01-26 00:16:04,311 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was TIMEOUT (1/3) [2024-01-26 00:16:04,313 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 00:16:04,314 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 00:16:04,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:16:04 BasicIcfg [2024-01-26 00:16:04,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 00:16:04,317 INFO L158 Benchmark]: Toolchain (without parser) took 884503.09ms. Allocated memory was 357.6MB in the beginning and 666.9MB in the end (delta: 309.3MB). Free memory was 307.1MB in the beginning and 583.3MB in the end (delta: -276.3MB). Peak memory consumption was 293.6MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,317 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 00:16:04,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.97ms. Allocated memory is still 357.6MB. Free memory was 306.7MB in the beginning and 274.5MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.80ms. Allocated memory is still 357.6MB. Free memory was 274.5MB in the beginning and 271.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,318 INFO L158 Benchmark]: Boogie Preprocessor took 48.96ms. Allocated memory is still 357.6MB. Free memory was 271.4MB in the beginning and 268.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,318 INFO L158 Benchmark]: RCFGBuilder took 551.72ms. Allocated memory is still 357.6MB. Free memory was 268.6MB in the beginning and 303.0MB in the end (delta: -34.4MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,318 INFO L158 Benchmark]: TraceAbstraction took 883199.23ms. Allocated memory was 357.6MB in the beginning and 666.9MB in the end (delta: 309.3MB). Free memory was 302.5MB in the beginning and 583.3MB in the end (delta: -280.9MB). Peak memory consumption was 287.5MB. Max. memory is 8.0GB. [2024-01-26 00:16:04,319 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.13ms. Allocated memory is still 207.6MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 633.97ms. Allocated memory is still 357.6MB. Free memory was 306.7MB in the beginning and 274.5MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.80ms. Allocated memory is still 357.6MB. Free memory was 274.5MB in the beginning and 271.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.96ms. Allocated memory is still 357.6MB. Free memory was 271.4MB in the beginning and 268.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 551.72ms. Allocated memory is still 357.6MB. Free memory was 268.6MB in the beginning and 303.0MB in the end (delta: -34.4MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * TraceAbstraction took 883199.23ms. Allocated memory was 357.6MB in the beginning and 666.9MB in the end (delta: 309.3MB). Free memory was 302.5MB in the beginning and 583.3MB in the end (delta: -280.9MB). Peak memory consumption was 287.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 25 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 10, RedundantProofs: 4, ProvenStates: 29, Times there's more than one choice: 19, Avg number of choices: 2.1724137931034484 - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.2s Time in loop, 0.2s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ~#__global_lock~0.offset, old(~#__global_lock~0.offset), ~tzname~0.offset, old(~tzname~0.offset), write~$Pointer$_#value.offset, read~$Pointer$_#value.base, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, ~timezone~0, old(~timezone~0), t_fun_#t~post15#1, t_fun_#t~post19#1, #memory_$Pointer$.base, old(#memory_$Pointer$.base), t_fun_#t~post26#1, t_funThread1of1ForFork0_#in~arg#1.base, ULTIMATE.start_main_#t~mem37#1, ~__daylight~0, old(~__daylight~0), ULTIMATE.start_main_#res#1, t_fun_~p~3#1.offset, ULTIMATE.start_list_add_#in~new#1.base, t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_fun_#in~arg#1.offset, ULTIMATE.start_list_add_~next~0#1.offset, t_fun_#t~nondet9#1, t_fun_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_~p~3#1.base, ULTIMATE.start_list_add_~new#1.base, t_funThread1of1ForFork0_#t~mem24#1.base, t_fun_#t~mem11#1.base, ULTIMATE.start_lookup1_#res#1.offset, ULTIMATE.start_lookup1_#t~mem6#1.base, t_funThread1of1ForFork0_#t~nondet10#1, t_funThread1of1ForFork0_#t~nondet12#1, t_funThread1of1ForFork0_#t~nondet13#1, t_funThread1of1ForFork0_#t~nondet16#1, t_funThread1of1ForFork0_#t~nondet17#1, t_funThread1of1ForFork0_#t~nondet20#1, t_funThread1of1ForFork0_#t~nondet21#1, t_funThread1of1ForFork0_#t~nondet23#1, t_funThread1of1ForFork0_#t~nondet25#1, ULTIMATE.start_lookup1_~hvalue1~0#1, read~int_#ptr.base, #PthreadsMutexLock_#inputPtr.offset, read~$Pointer$_#ptr.offset, ULTIMATE.start_#t~ret38#1, ULTIMATE.start_new_#res#1.base, ULTIMATE.start_lookup2_~p~2#1.base, ULTIMATE.start_new_#res#1.offset, t_fun_~arg#1.offset, ULTIMATE.start_list_add_~head#1.base, ULTIMATE.start_new_#t~malloc3#1.offset, ULTIMATE.start_lookup2_~hvalue2~0#1, ULTIMATE.start_list_add_#in~new#1.offset, ULTIMATE.start_lookup1_~d#1, t_fun_#t~mem14#1, t_fun_#t~mem18#1, t_fun_#t~mem22#1, #Ultimate.allocOnStack_~size, #memory_$Pointer$.offset, old(#memory_$Pointer$.offset), ULTIMATE.start_lookup1_#in~d#1, t_funThread1of1ForFork0_~q~0#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~2#1, t_funThread1of1ForFork0_~pos~0#1.offset, read~int_#sizeOfReadType, t_funThread1of1ForFork0_~arg#1.base, write~init~int_#sizeOfWrittenType, t_fun___VERIFIER_assert_#in~cond#1, ~daylight~0, old(~daylight~0), read~$Pointer$_#ptr.base, ULTIMATE.start_new_~x#1, t_funThread1of1ForFork0_#t~mem11#1.offset, ULTIMATE.start_list_add_#t~mem4#1.offset, ~tzname~0.base, old(~tzname~0.base), ULTIMATE.start_INIT_LIST_HEAD_~list#1.base, t_funThread1of1ForFork0_#t~mem24#1.offset, read~$Pointer$_#value.offset, t_fun_#res#1.base, ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_list_add_~new#1.offset, t_fun_~j~0#1, t_funThread1of1ForFork0_~pos~0#1.base, #PthreadsMutexUnlock_#inputPtr.base, t_funThread1of1ForFork0_~q~0#1.offset, #Ultimate.allocOnStack_#res.offset, ULTIMATE.start_main_#t~pre34#1, ULTIMATE.dealloc_~addr.offset, ~__tzname~0.offset, old(~__tzname~0.offset), write~int_#value, ULTIMATE.start_main_~t1~0#1, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ULTIMATE.start_lookup2_#res#1.offset, ULTIMATE.start_list_add_~next~0#1.base, read~$Pointer$_#sizeOfReadType, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~j~1#1, #pthreadsForks, old(#pthreadsForks), ULTIMATE.start_INIT_LIST_HEAD_#in~list#1.offset, ULTIMATE.start_new_~p~0#1.base, t_fun_#in~arg#1.base, ~#__global_lock~0.base, old(~#__global_lock~0.base), t_funThread1of1ForFork0_thidvar0, old(t_funThread1of1ForFork0_thidvar0), #Ultimate.allocOnHeap_#res.base, t_fun_#res#1.offset, ULTIMATE.start_main_~pp~0#1.offset, #valid, old(#valid), #pthreadsMutex, old(#pthreadsMutex), t_fun___VERIFIER_assert_~cond#1, read~int_#value, #Ultimate.allocInit_~size, t_fun_~p~3#1.base, t_fun_#t~mem24#1.base, #PthreadsMutexLock_#inputPtr.base, ULTIMATE.start_lookup1_#res#1.base, t_fun_#t~nondet10#1, t_fun_#t~nondet12#1, t_fun_#t~nondet13#1, t_fun_#t~nondet16#1, t_fun_#t~nondet17#1, t_funThread1of1ForFork0_#t~post15#1, t_funThread1of1ForFork0_#t~post19#1, ULTIMATE.start_list_add_~head#1.offset, t_fun_#t~nondet20#1, t_fun_#t~nondet21#1, t_fun_#t~nondet23#1, t_fun_#t~nondet25#1, t_funThread1of1ForFork0_#t~post26#1, write~init~int_#ptr.base, ULTIMATE.start_lookup1_~p~1#1.offset, t_funThread1of1ForFork0_~p~3#1.offset, #PthreadsMutexUnlock_#res, ULTIMATE.start_main_~t2~0#1, ULTIMATE.start_lookup2_#t~mem8#1.offset, ULTIMATE.start_lookup2_~d#1, t_funThread1of1ForFork0_#in~arg#1.offset, ULTIMATE.start_new_#t~malloc3#1.base, ULTIMATE.start_INIT_LIST_HEAD_~list#1.offset, t_funThread1of1ForFork0_#t~nondet9#1, ULTIMATE.start_list_add_#t~mem4#1.base, ULTIMATE.start_INIT_LIST_HEAD_#in~list#1.base, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_new_~p~0#1.offset, write~$Pointer$_#value.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_#t~mem11#1.base, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_lookup1_#t~mem6#1.offset, write~$Pointer$_#sizeOfWrittenType, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~nondet35#1, #length, old(#length), ULTIMATE.start_main_#t~ret30#1.offset, t_fun_~q~0#1.base, write~int_#sizeOfWrittenType, ULTIMATE.start_main_#t~ret31#1.offset, t_fun_~pos~0#1.offset, t_fun_~arg#1.base, #StackHeapBarrier, old(#StackHeapBarrier), t_funThread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~ret32#1.offset, ~__timezone~0, old(~__timezone~0), t_fun_#t~mem11#1.offset, ULTIMATE.start_main_~pp~0#1.base, #PthreadsMutexLock_#res, ULTIMATE.start_list_add_#in~head#1.base, ULTIMATE.start_main_#t~ret32#1.base, t_funThread1of1ForFork0_#t~mem14#1, t_funThread1of1ForFork0_#t~mem18#1, write~$Pointer$_#ptr.offset, t_fun_#t~mem24#1.offset, ULTIMATE.start_lookup2_#t~nondet7#1, t_funThread1of1ForFork0_#t~mem22#1, ULTIMATE.start_lookup2_#t~mem8#1.base, ULTIMATE.start_main_#t~post28#1, ULTIMATE.start_main_#t~post29#1, ULTIMATE.start_main_#t~post33#1, ULTIMATE.start_main_#t~post36#1, ULTIMATE.start_main_#t~ret31#1.base, ULTIMATE.start_lookup2_#in~d#1, t_fun_~pos~0#1.base, ~#c~0.offset, old(~#c~0.offset), write~int_#ptr.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_fun_~q~0#1.offset, ULTIMATE.start_lookup1_~p~1#1.base, #Ultimate.allocOnHeap_~size, ~__tzname~0.base, old(~__tzname~0.base), #memory_int, old(#memory_int), ULTIMATE.start_main_#t~ret30#1.base, ~#c~0.base, old(~#c~0.base), #Ultimate.allocOnStack_#res.base, t_funThread1of1ForFork0_#res#1.base, ULTIMATE.start_lookup1_#t~nondet5#1, t_fun_assume_abort_if_not_~cond#1, ULTIMATE.start_lookup2_#res#1.base, ULTIMATE.start_new_#in~x#1, t_funThread1of1ForFork0_~j~0#1, ULTIMATE.start_lookup2_~p~2#1.offset, write~$Pointer$_#ptr.base, ULTIMATE.start_list_add_#in~head#1.offset, read~int_#ptr.offset, #PthreadsMutexUnlock_#inputPtr.offset], Protected Variables before encountering a loop: [] - TimeoutResultAtElement [Line: 1082]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 2478 with TraceHistMax 64,while AutomatonFreeRefinementEngine was Timeout during CAMEL. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 312 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 883.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 1.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2030 NumberOfCodeBlocks, 1597 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 3931 ConstructedInterpolants, 0 QuantifiedInterpolants, 10379 SizeOfPredicates, 18 NumberOfNonLiveVariables, 6283 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 11791/31235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown