/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/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:03:33,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:03:33,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:03:33,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:03:33,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:03:33,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:03:33,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:03:33,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:03:33,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:03:33,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:03:33,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:03:33,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:03:33,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:03:33,674 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:03:33,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:03:33,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:03:33,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:03:33,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:03:33,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:03:33,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:03:33,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:03:33,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:03:33,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:03:33,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:03:33,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:03:33,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:03:33,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:03:33,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:03:33,678 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:03:33,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:03:33,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:03:33,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:03:33,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:03:33,680 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:03:33,680 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:03:33,680 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:03:33,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:03:33,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:03:33,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:03:33,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:03:33,856 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:03:33,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-26 00:03:34,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:03:35,121 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:03:35,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-26 00:03:35,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/893d772d5/83524644839946698c45edb342e0dc52/FLAG2656dc50e [2024-01-26 00:03:35,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/893d772d5/83524644839946698c45edb342e0dc52 [2024-01-26 00:03:35,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:03:35,138 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:03:35,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:03:35,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:03:35,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:03:35,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e7d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35, skipping insertion in model container [2024-01-26 00:03:35,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:03:35,269 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-26 00:03:35,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:03:35,279 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:03:35,295 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-26 00:03:35,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:03:35,306 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:03:35,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35 WrapperNode [2024-01-26 00:03:35,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:03:35,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:03:35,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:03:35,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:03:35,314 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:03:35" (1/1) ... [2024-01-26 00:03:35,320 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:03:35" (1/1) ... [2024-01-26 00:03:35,333 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-01-26 00:03:35,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:03:35,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:03:35,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:03:35,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:03:35,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:03:35,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:03:35,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:03:35,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:03:35,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (1/1) ... [2024-01-26 00:03:35,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:03:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:03:35,386 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:03:35,390 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:03:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:03:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 00:03:35,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 00:03:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 00:03:35,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 00:03:35,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-26 00:03:35,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:03:35,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:03:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:03:35,414 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:03:35,481 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:03:35,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:03:35,694 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:03:35,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:03:35,704 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 00:03:35,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:03:35 BoogieIcfgContainer [2024-01-26 00:03:35,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:03:35,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:03:35,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:03:35,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:03:35,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:03:35" (1/3) ... [2024-01-26 00:03:35,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a0802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:03:35, skipping insertion in model container [2024-01-26 00:03:35,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:03:35" (2/3) ... [2024-01-26 00:03:35,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a0802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:03:35, skipping insertion in model container [2024-01-26 00:03:35,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:03:35" (3/3) ... [2024-01-26 00:03:35,721 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-26 00:03:35,727 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:03:35,747 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:03:35,748 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:03:35,748 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:03:35,848 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-26 00:03:35,900 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:03:35,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:03:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:03:35,929 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:03:35,932 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:03:35,963 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:03:35,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 00:03:35,977 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;@5e70ac96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:03:35,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 00:03:36,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:03:36,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:03:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1966068878, now seen corresponding path program 1 times [2024-01-26 00:03:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:03:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240777108] [2024-01-26 00:03:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:03:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:03:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:03:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:03:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:03:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240777108] [2024-01-26 00:03:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240777108] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:03:36,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:03:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:03:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416996259] [2024-01-26 00:03:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:03:36,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:03:36,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:03:36,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:03:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:03:36,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:03:36,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:03:36,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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:03:36,609 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 [2024-01-26 00:03:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:03:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 00:03:36,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:03:36,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:03:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 213638889, now seen corresponding path program 1 times [2024-01-26 00:03:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:03:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202297375] [2024-01-26 00:03:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:03:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:03:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:03:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:03:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:03:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202297375] [2024-01-26 00:03:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202297375] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:03:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563878835] [2024-01-26 00:03:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:03:37,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:03:37,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:03:37,162 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:03:37,172 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:03:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:03:37,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-26 00:03:37,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:03:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:03:37,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:03:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:03:37,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563878835] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:03:37,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:03:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-01-26 00:03:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140307725] [2024-01-26 00:03:37,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:03:37,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:03:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:03:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:03:37,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:03:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:03:37,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:03:37,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:03:37,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:03:37,799 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 [2024-01-26 00:03:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:03:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:03:38,212 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:03:38,409 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,SelfDestructingSolverStorable1 [2024-01-26 00:03:38,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:03:38,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:03:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1771454871, now seen corresponding path program 1 times [2024-01-26 00:03:38,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:03:38,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087149098] [2024-01-26 00:03:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:03:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:03:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:03:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:03:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:03:39,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087149098] [2024-01-26 00:03:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087149098] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:03:39,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652353431] [2024-01-26 00:03:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:03:39,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:03:39,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:03:39,617 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:03:39,673 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:04:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:04:25,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 23 conjunts are in the unsatisfiable core [2024-01-26 00:04:25,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:05:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:05:13,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:06:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:06:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652353431] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:06:31,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:06:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 33 [2024-01-26 00:06:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148917000] [2024-01-26 00:06:31,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:06:31,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-01-26 00:06:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:06:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-01-26 00:06:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=845, Unknown=37, NotChecked=0, Total=1056 [2024-01-26 00:06:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:06:31,484 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:06:31,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.575757575757576) internal successors, (217), 33 states have internal predecessors, (217), 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:06:31,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:06:31,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:06:31,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:06:44,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:06:53,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:06:55,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:06:56,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:19,944 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 86 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:07:21,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:24,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:26,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:28,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:30,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:32,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:51,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:07:52,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:34,366 WARN L293 SmtUtils]: Spent 34.53s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:08:36,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:38,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:40,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Found a loop, use abstraction hammer [2024-01-26 00:08:42,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:44,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:46,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:48,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:08:49,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:23,898 WARN L293 SmtUtils]: Spent 9.19s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:09:25,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:27,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:29,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:31,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:34,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:36,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:38,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:40,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:42,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:47,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:48,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:09:50,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:10:46,027 WARN L293 SmtUtils]: Spent 37.00s on a formula simplification. DAG size of input: 75 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:10:47,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:10:50,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:10:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:10:54,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:09,282 WARN L293 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 90 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:11:11,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:13,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:15,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:17,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:19,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:21,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:23,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:25,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:27,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:29,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:31,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:33,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:35,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:37,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:39,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:41,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:43,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:45,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:47,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:48,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:51,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:53,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:55,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:11:58,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:12:06,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:12:08,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:12:10,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer 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:12:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:12:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:12:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-26 00:12:30,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-26 00:12:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:12:31,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:12:31,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:12:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash -620591014, now seen corresponding path program 1 times [2024-01-26 00:12:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:12:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192987784] [2024-01-26 00:12:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:12:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:12:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:12:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-01-26 00:12:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:12:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192987784] [2024-01-26 00:12:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192987784] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:12:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391890461] [2024-01-26 00:12:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:12:31,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:12:31,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:12:31,566 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:12:31,567 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:12:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:12:31,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-26 00:12:31,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:12:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 00:12:31,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:12:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 00:12:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391890461] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:12:32,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:12:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-01-26 00:12:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385996177] [2024-01-26 00:12:32,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:12:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-26 00:12:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:12:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-26 00:12:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-01-26 00:12:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:12:32,176 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:12:32,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 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:12:32,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:12:32,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:12:32,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-01-26 00:12:32,177 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 [2024-01-26 00:12:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:12:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:12:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-26 00:12:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-26 00:12:32,533 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:12:32,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:12:32,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:12:32,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:12:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash -816820195, now seen corresponding path program 1 times [2024-01-26 00:12:32,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:12:32,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446285553] [2024-01-26 00:12:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:12:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:12:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:12:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-01-26 00:12:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:12:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446285553] [2024-01-26 00:12:39,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446285553] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 00:12:39,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906464903] [2024-01-26 00:12:39,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:12:39,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:12:39,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:12:39,983 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:12:39,986 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:14:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:14:07,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-26 00:14:07,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 00:14:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 00:14:22,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 00:16:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 00:16:21,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906464903] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 00:16:21,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 00:16:21,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 18] total 38 [2024-01-26 00:16:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461360079] [2024-01-26 00:16:21,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 00:16:21,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-01-26 00:16:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:16:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-01-26 00:16:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1041, Unknown=10, NotChecked=0, Total=1406 [2024-01-26 00:16:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:16:21,185 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:16:21,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.315789473684211) internal successors, (240), 38 states have internal predecessors, (240), 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:16:21,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:16:21,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-01-26 00:16:21,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-01-26 00:16:21,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-01-26 00:16:21,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:16:52,505 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 94 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:16:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Found a loop, use abstraction hammer [2024-01-26 00:17:16,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:18,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:28,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:30,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:32,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:35,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:37,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:40,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:17:41,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:18:01,532 WARN L293 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 00:18:02,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:18:05,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:18:07,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-26 00:18:09,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Received shutdown request... [2024-01-26 00:18:11,739 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:18:11,739 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 00:18:11,739 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:18:12,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 00:18:12,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 00:18:12,306 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 49 known predicates. [2024-01-26 00:18:12,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 00:18:12,314 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-01-26 00:18:12,315 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-01-26 00:18:12,317 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 00:18:12,317 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 00:18:12,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:18:12 BasicIcfg [2024-01-26 00:18:12,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 00:18:12,320 INFO L158 Benchmark]: Toolchain (without parser) took 877182.26ms. Allocated memory was 232.8MB in the beginning and 508.6MB in the end (delta: 275.8MB). Free memory was 180.5MB in the beginning and 244.4MB in the end (delta: -63.8MB). Peak memory consumption was 213.4MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,320 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 00:18:12,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.20ms. Allocated memory is still 232.8MB. Free memory was 180.5MB in the beginning and 168.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 232.8MB. Free memory was 168.6MB in the beginning and 167.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,324 INFO L158 Benchmark]: Boogie Preprocessor took 18.70ms. Allocated memory is still 232.8MB. Free memory was 167.1MB in the beginning and 165.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,324 INFO L158 Benchmark]: RCFGBuilder took 351.49ms. Allocated memory is still 232.8MB. Free memory was 165.4MB in the beginning and 149.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,324 INFO L158 Benchmark]: TraceAbstraction took 876613.78ms. Allocated memory was 232.8MB in the beginning and 508.6MB in the end (delta: 275.8MB). Free memory was 149.1MB in the beginning and 244.4MB in the end (delta: -95.3MB). Peak memory consumption was 182.0MB. Max. memory is 8.0GB. [2024-01-26 00:18:12,327 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 164.6MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.20ms. Allocated memory is still 232.8MB. Free memory was 180.5MB in the beginning and 168.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 232.8MB. Free memory was 168.6MB in the beginning and 167.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.70ms. Allocated memory is still 232.8MB. Free memory was 167.1MB in the beginning and 165.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.49ms. Allocated memory is still 232.8MB. Free memory was 165.4MB in the beginning and 149.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 876613.78ms. Allocated memory was 232.8MB in the beginning and 508.6MB in the end (delta: 275.8MB). Free memory was 149.1MB in the beginning and 244.4MB in the end (delta: -95.3MB). Peak memory consumption was 182.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3039, independent: 2816, independent conditional: 2816, independent unconditional: 0, dependent: 223, dependent conditional: 223, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2816, independent: 2816, independent conditional: 2816, 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: 2816, independent: 2816, independent conditional: 2816, 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: 2816, independent: 2816, independent conditional: 0, independent unconditional: 2816, 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: 2816, independent: 2816, independent conditional: 0, independent unconditional: 2816, 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: 2816, independent: 2816, independent conditional: 0, independent unconditional: 2816, 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: 2816, independent: 2816, independent conditional: 0, independent unconditional: 2816, 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: 2816, independent: 2816, independent conditional: 0, independent unconditional: 2816, 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: 2816, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2816, unknown conditional: 0, unknown unconditional: 2816] , Statistics on independence cache: Total cache size (in pairs): 2816, Positive cache size: 2816, Positive conditional cache size: 0, Positive unconditional cache size: 2816, 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: 0, Independence queries for same thread: 223 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 8, RedundantProofs: 4, ProvenStates: 168, Times there's more than one choice: 107, Avg number of choices: 2.0476190476190474 - StatisticsResult: Reduction benchmarks 0.2s Time before loop, 0.2s Time in loop, 0.3s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_main_~#t4~0#1.offset, write~int_#ptr.base, thread3Thread1of1ForFork3_#in~_argptr.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet1#1, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet9#1, thread2Thread1of1ForFork2_#res.offset, ULTIMATE.start_main_~#t3~0#1.offset, thread3Thread1of1ForFork3_~_argptr.base, read~int_#ptr.base, ULTIMATE.start_#t~ret18#1, thread1_#res.offset, thread2_#res.offset, thread3_#res.offset, thread4_#res.offset, thread2Thread1of1ForFork2_~_argptr.offset, thread4Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork2_thidvar0, old(thread2Thread1of1ForFork2_thidvar0), thread2Thread1of1ForFork2_thidvar1, old(thread2Thread1of1ForFork2_thidvar1), thread2Thread1of1ForFork2_thidvar2, old(thread2Thread1of1ForFork2_thidvar2), thread2Thread1of1ForFork2_#in~_argptr.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread4Thread1of1ForFork1_#in~_argptr.offset, thread1Thread1of1ForFork0_#res.offset, thread1_~_argptr.offset, thread2_~_argptr.offset, thread3_~_argptr.offset, thread4_~_argptr.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread1_#in~_argptr.base, thread2_#in~_argptr.base, thread3_#in~_argptr.base, thread4_#in~_argptr.base, thread2Thread1of1ForFork2_~_argptr.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, old(~x1~0), ~x2~0, old(~x2~0), ~x3~0, old(~x3~0), ~x4~0, old(~x4~0), thread1Thread1of1ForFork0_~_argptr.offset, thread3Thread1of1ForFork3_#res.base, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~pre12#1, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, thread1Thread1of1ForFork0_#in~_argptr.base, write~int_#value, write~init~int_#ptr.offset, thread1_~_argptr.base, thread2_~_argptr.base, thread3_~_argptr.base, thread4_~_argptr.base, ULTIMATE.dealloc_~addr.base, thread3Thread1of1ForFork3_#in~_argptr.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), ~n~0, old(~n~0), thread1Thread1of1ForFork0_~_argptr.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork2_#res.base, write~init~int_#ptr.base, thread2Thread1of1ForFork2_#in~_argptr.offset, thread1_#res.base, thread2_#res.base, thread3_#res.base, thread4_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#res.offset, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_#in~_argptr.offset, thread2_#in~_argptr.offset, thread3_#in~_argptr.offset, thread4_#in~_argptr.offset, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork0_#res.base, thread4Thread1of1ForFork1_~_argptr.offset, ULTIMATE.start_main_~#t4~0#1.base, thread4Thread1of1ForFork1_#in~_argptr.base, thread1Thread1of1ForFork0_#in~_argptr.offset, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~pre8#1, thread3Thread1of1ForFork3_#res.offset, #memory_int, old(#memory_int), #Ultimate.allocOnStack_#res.base, thread4Thread1of1ForFork1_thidvar0, old(thread4Thread1of1ForFork1_thidvar0), thread4Thread1of1ForFork1_thidvar1, old(thread4Thread1of1ForFork1_thidvar1), thread4Thread1of1ForFork1_thidvar2, old(thread4Thread1of1ForFork1_thidvar2), thread4Thread1of1ForFork1_thidvar3, old(thread4Thread1of1ForFork1_thidvar3), thread4Thread1of1ForFork1_thidvar4, old(thread4Thread1of1ForFork1_thidvar4), thread3Thread1of1ForFork3_thidvar0, old(thread3Thread1of1ForFork3_thidvar0), thread3Thread1of1ForFork3_thidvar1, old(thread3Thread1of1ForFork3_thidvar1), thread3Thread1of1ForFork3_thidvar2, old(thread3Thread1of1ForFork3_thidvar2), thread3Thread1of1ForFork3_thidvar3, old(thread3Thread1of1ForFork3_thidvar3), thread4Thread1of1ForFork1_~_argptr.base, thread3Thread1of1ForFork3_~_argptr.offset, read~int_#ptr.offset], Protected Variables before encountering a loop: [] - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 149 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 876.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 471.7s, 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: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 140.1s SatisfiabilityAnalysisTime, 263.2s InterpolantComputationTime, 959 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1376 ConstructedInterpolants, 0 QuantifiedInterpolants, 22306 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 107/201 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