./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:33:37,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:33:37,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:33:37,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:33:37,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:33:37,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:33:37,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:33:37,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:33:37,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:33:37,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:33:37,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:33:37,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:33:37,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:33:37,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:33:37,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:33:37,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:33:37,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:33:37,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:33:37,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:33:37,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:33:37,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:33:37,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:33:37,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:33:37,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:33:37,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:33:37,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:33:37,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:33:37,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:33:37,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:33:37,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:33:37,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:33:37,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:33:37,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:37,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:33:37,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:33:37,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:33:37,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:33:37,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:33:37,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:33:37,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:33:37,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:33:37,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:33:37,431 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2024-11-18 14:33:37,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:33:37,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:33:37,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:33:37,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:33:37,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:33:37,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-18 14:33:39,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:33:39,373 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:33:39,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2024-11-18 14:33:39,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243c23573/200ce4436a2049868fe3760f7e015741/FLAG59ef10307 [2024-11-18 14:33:39,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243c23573/200ce4436a2049868fe3760f7e015741 [2024-11-18 14:33:39,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:33:39,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:33:39,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:39,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:33:39,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:33:39,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:39" (1/1) ... [2024-11-18 14:33:39,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729c590e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:39, skipping insertion in model container [2024-11-18 14:33:39,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:39" (1/1) ... [2024-11-18 14:33:39,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:33:39,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2024-11-18 14:33:40,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:40,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:33:40,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2024-11-18 14:33:40,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:40,083 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:33:40,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40 WrapperNode [2024-11-18 14:33:40,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:40,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:40,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:33:40,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:33:40,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,128 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 204 [2024-11-18 14:33:40,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:40,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:33:40,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:33:40,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:33:40,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 14:33:40,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:33:40,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:33:40,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:33:40,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:33:40,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (1/1) ... [2024-11-18 14:33:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:40,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:40,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 14:33:40,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 14:33:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:33:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-18 14:33:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-18 14:33:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:33:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-18 14:33:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-18 14:33:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-18 14:33:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-18 14:33:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:33:40,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:33:40,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:33:40,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:33:40,723 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-18 14:33:40,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:33:40,744 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:33:40,745 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 14:33:40,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:40 BoogieIcfgContainer [2024-11-18 14:33:40,745 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:33:40,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:33:40,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:33:40,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:33:40,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:33:39" (1/3) ... [2024-11-18 14:33:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f506c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:40, skipping insertion in model container [2024-11-18 14:33:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:40" (2/3) ... [2024-11-18 14:33:40,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f506c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:40, skipping insertion in model container [2024-11-18 14:33:40,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:40" (3/3) ... [2024-11-18 14:33:40,757 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2024-11-18 14:33:40,773 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:33:40,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:33:40,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:33:40,847 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@719fcc28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:33:40,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:33:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 14:33:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 14:33:40,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:40,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:40,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:40,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -21131724, now seen corresponding path program 1 times [2024-11-18 14:33:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311118845] [2024-11-18 14:33:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:41,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311118845] [2024-11-18 14:33:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311118845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:41,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958692862] [2024-11-18 14:33:41,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:41,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:41,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,165 INFO L87 Difference]: Start difference. First operand has 74 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 66 states have internal predecessors, (97), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:41,235 INFO L93 Difference]: Finished difference Result 203 states and 309 transitions. [2024-11-18 14:33:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-18 14:33:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:41,245 INFO L225 Difference]: With dead ends: 203 [2024-11-18 14:33:41,245 INFO L226 Difference]: Without dead ends: 127 [2024-11-18 14:33:41,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,251 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 76 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:41,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-18 14:33:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2024-11-18 14:33:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 109 states have internal predecessors, (149), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-18 14:33:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2024-11-18 14:33:41,302 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 43 [2024-11-18 14:33:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:41,303 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2024-11-18 14:33:41,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2024-11-18 14:33:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 14:33:41,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:41,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:41,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:33:41,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:41,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1928738726, now seen corresponding path program 1 times [2024-11-18 14:33:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525135331] [2024-11-18 14:33:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525135331] [2024-11-18 14:33:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525135331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166313430] [2024-11-18 14:33:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,434 INFO L87 Difference]: Start difference. First operand 123 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:41,486 INFO L93 Difference]: Finished difference Result 331 states and 459 transitions. [2024-11-18 14:33:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:41,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-18 14:33:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:41,493 INFO L225 Difference]: With dead ends: 331 [2024-11-18 14:33:41,495 INFO L226 Difference]: Without dead ends: 216 [2024-11-18 14:33:41,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,498 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:41,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 187 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-18 14:33:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2024-11-18 14:33:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.378698224852071) internal successors, (233), 170 states have internal predecessors, (233), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-18 14:33:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2024-11-18 14:33:41,528 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 44 [2024-11-18 14:33:41,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:41,529 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2024-11-18 14:33:41,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2024-11-18 14:33:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 14:33:41,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:41,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:41,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:33:41,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:41,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1081871109, now seen corresponding path program 1 times [2024-11-18 14:33:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:41,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297476116] [2024-11-18 14:33:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:41,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297476116] [2024-11-18 14:33:41,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297476116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:41,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:41,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:41,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968101658] [2024-11-18 14:33:41,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:41,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:41,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,643 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:41,730 INFO L93 Difference]: Finished difference Result 543 states and 750 transitions. [2024-11-18 14:33:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-18 14:33:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:41,736 INFO L225 Difference]: With dead ends: 543 [2024-11-18 14:33:41,736 INFO L226 Difference]: Without dead ends: 361 [2024-11-18 14:33:41,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,741 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:41,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 180 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-18 14:33:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 347. [2024-11-18 14:33:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 308 states have (on average 1.3474025974025974) internal successors, (415), 311 states have internal predecessors, (415), 24 states have call successors, (24), 15 states have call predecessors, (24), 14 states have return successors, (32), 20 states have call predecessors, (32), 22 states have call successors, (32) [2024-11-18 14:33:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 471 transitions. [2024-11-18 14:33:41,799 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 471 transitions. Word has length 44 [2024-11-18 14:33:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:41,800 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 471 transitions. [2024-11-18 14:33:41,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 14:33:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 471 transitions. [2024-11-18 14:33:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 14:33:41,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:41,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:41,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:33:41,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:41,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1162995804, now seen corresponding path program 1 times [2024-11-18 14:33:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:41,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769959598] [2024-11-18 14:33:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:41,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769959598] [2024-11-18 14:33:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769959598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:41,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141391935] [2024-11-18 14:33:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:41,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:41,955 INFO L87 Difference]: Start difference. First operand 347 states and 471 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:33:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:42,019 INFO L93 Difference]: Finished difference Result 859 states and 1168 transitions. [2024-11-18 14:33:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:42,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 61 [2024-11-18 14:33:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:42,026 INFO L225 Difference]: With dead ends: 859 [2024-11-18 14:33:42,026 INFO L226 Difference]: Without dead ends: 520 [2024-11-18 14:33:42,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:42,029 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 55 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:42,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-18 14:33:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-11-18 14:33:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 459 states have (on average 1.298474945533769) internal successors, (596), 462 states have internal predecessors, (596), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (54), 34 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-18 14:33:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 688 transitions. [2024-11-18 14:33:42,068 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 688 transitions. Word has length 61 [2024-11-18 14:33:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:42,068 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 688 transitions. [2024-11-18 14:33:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:33:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 688 transitions. [2024-11-18 14:33:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 14:33:42,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:42,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:42,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:33:42,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1047893343, now seen corresponding path program 1 times [2024-11-18 14:33:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898591040] [2024-11-18 14:33:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 14:33:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898591040] [2024-11-18 14:33:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898591040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251697105] [2024-11-18 14:33:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:42,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:42,132 INFO L87 Difference]: Start difference. First operand 520 states and 688 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:33:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:42,170 INFO L93 Difference]: Finished difference Result 1067 states and 1409 transitions. [2024-11-18 14:33:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2024-11-18 14:33:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:42,175 INFO L225 Difference]: With dead ends: 1067 [2024-11-18 14:33:42,175 INFO L226 Difference]: Without dead ends: 647 [2024-11-18 14:33:42,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:42,177 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 55 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:42,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-18 14:33:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2024-11-18 14:33:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 572 states have (on average 1.2727272727272727) internal successors, (728), 575 states have internal predecessors, (728), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (66), 42 states have call predecessors, (66), 44 states have call successors, (66) [2024-11-18 14:33:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 840 transitions. [2024-11-18 14:33:42,219 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 840 transitions. Word has length 66 [2024-11-18 14:33:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:42,220 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 840 transitions. [2024-11-18 14:33:42,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:33:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 840 transitions. [2024-11-18 14:33:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 14:33:42,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:42,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:42,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:33:42,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:42,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1099770361, now seen corresponding path program 1 times [2024-11-18 14:33:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917577760] [2024-11-18 14:33:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:33:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917577760] [2024-11-18 14:33:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917577760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635283229] [2024-11-18 14:33:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:42,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:42,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:42,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:33:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:42,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 14:33:42,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:33:42,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635283229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:42,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-18 14:33:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697765491] [2024-11-18 14:33:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:42,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:33:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:42,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:33:42,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:33:42,502 INFO L87 Difference]: Start difference. First operand 647 states and 840 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:33:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:42,650 INFO L93 Difference]: Finished difference Result 1075 states and 1415 transitions. [2024-11-18 14:33:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:33:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-18 14:33:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:42,655 INFO L225 Difference]: With dead ends: 1075 [2024-11-18 14:33:42,658 INFO L226 Difference]: Without dead ends: 534 [2024-11-18 14:33:42,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:33:42,661 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:42,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-18 14:33:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-11-18 14:33:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 475 states have (on average 1.2652631578947369) internal successors, (601), 478 states have internal predecessors, (601), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (50), 32 states have call predecessors, (50), 34 states have call successors, (50) [2024-11-18 14:33:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 687 transitions. [2024-11-18 14:33:42,691 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 687 transitions. Word has length 67 [2024-11-18 14:33:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 687 transitions. [2024-11-18 14:33:42,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:33:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 687 transitions. [2024-11-18 14:33:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 14:33:42,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:42,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:42,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:33:42,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 14:33:42,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:42,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1145429959, now seen corresponding path program 1 times [2024-11-18 14:33:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987687690] [2024-11-18 14:33:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:33:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987687690] [2024-11-18 14:33:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987687690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491788071] [2024-11-18 14:33:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:43,016 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:43,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:33:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:43,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 14:33:43,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:43,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 14:33:43,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491788071] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:43,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 14:33:43,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 14:33:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902047299] [2024-11-18 14:33:43,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:43,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:43,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:43,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:43,266 INFO L87 Difference]: Start difference. First operand 534 states and 687 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:33:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:43,334 INFO L93 Difference]: Finished difference Result 589 states and 754 transitions. [2024-11-18 14:33:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:33:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 67 [2024-11-18 14:33:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:43,340 INFO L225 Difference]: With dead ends: 589 [2024-11-18 14:33:43,340 INFO L226 Difference]: Without dead ends: 586 [2024-11-18 14:33:43,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:33:43,342 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:43,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 183 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-18 14:33:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 533. [2024-11-18 14:33:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 475 states have (on average 1.2610526315789474) internal successors, (599), 477 states have internal predecessors, (599), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (50), 32 states have call predecessors, (50), 34 states have call successors, (50) [2024-11-18 14:33:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 684 transitions. [2024-11-18 14:33:43,378 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 684 transitions. Word has length 67 [2024-11-18 14:33:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:43,380 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 684 transitions. [2024-11-18 14:33:43,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:33:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 684 transitions. [2024-11-18 14:33:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 14:33:43,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:43,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:43,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 14:33:43,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 14:33:43,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:43,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1148913692, now seen corresponding path program 1 times [2024-11-18 14:33:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172732036] [2024-11-18 14:33:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:33:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172732036] [2024-11-18 14:33:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172732036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149112395] [2024-11-18 14:33:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:43,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:43,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:43,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:43,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 14:33:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:43,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 14:33:43,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:44,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 14:33:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149112395] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:44,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:44,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2024-11-18 14:33:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890234991] [2024-11-18 14:33:44,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 14:33:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 14:33:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:33:44,139 INFO L87 Difference]: Start difference. First operand 533 states and 684 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 14:33:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:44,480 INFO L93 Difference]: Finished difference Result 1761 states and 2295 transitions. [2024-11-18 14:33:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 14:33:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 68 [2024-11-18 14:33:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:44,489 INFO L225 Difference]: With dead ends: 1761 [2024-11-18 14:33:44,489 INFO L226 Difference]: Without dead ends: 1334 [2024-11-18 14:33:44,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-18 14:33:44,493 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 259 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:44,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1299 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-18 14:33:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 883. [2024-11-18 14:33:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 791 states have (on average 1.2490518331226297) internal successors, (988), 797 states have internal predecessors, (988), 54 states have call successors, (54), 36 states have call predecessors, (54), 37 states have return successors, (79), 49 states have call predecessors, (79), 53 states have call successors, (79) [2024-11-18 14:33:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1121 transitions. [2024-11-18 14:33:44,558 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1121 transitions. Word has length 68 [2024-11-18 14:33:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:44,559 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1121 transitions. [2024-11-18 14:33:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 14:33:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1121 transitions. [2024-11-18 14:33:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 14:33:44,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:44,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:44,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 14:33:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:44,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 892057432, now seen corresponding path program 1 times [2024-11-18 14:33:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001637960] [2024-11-18 14:33:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 14:33:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:44,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001637960] [2024-11-18 14:33:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001637960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716891307] [2024-11-18 14:33:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:44,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:44,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:44,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:44,828 INFO L87 Difference]: Start difference. First operand 883 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 14:33:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:44,890 INFO L93 Difference]: Finished difference Result 1482 states and 1890 transitions. [2024-11-18 14:33:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:44,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 87 [2024-11-18 14:33:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:44,895 INFO L225 Difference]: With dead ends: 1482 [2024-11-18 14:33:44,896 INFO L226 Difference]: Without dead ends: 775 [2024-11-18 14:33:44,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:44,898 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:44,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-18 14:33:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 763. [2024-11-18 14:33:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 683 states have (on average 1.240117130307467) internal successors, (847), 690 states have internal predecessors, (847), 47 states have call successors, (47), 31 states have call predecessors, (47), 32 states have return successors, (69), 41 states have call predecessors, (69), 46 states have call successors, (69) [2024-11-18 14:33:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 963 transitions. [2024-11-18 14:33:44,955 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 963 transitions. Word has length 87 [2024-11-18 14:33:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 963 transitions. [2024-11-18 14:33:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 14:33:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 963 transitions. [2024-11-18 14:33:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 14:33:44,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:44,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:33:44,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:44,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -265590444, now seen corresponding path program 1 times [2024-11-18 14:33:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982520565] [2024-11-18 14:33:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-18 14:33:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982520565] [2024-11-18 14:33:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982520565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291117712] [2024-11-18 14:33:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:45,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:45,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 14:33:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:45,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 14:33:45,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 14:33:45,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291117712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:45,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-18 14:33:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067567376] [2024-11-18 14:33:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:45,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:45,145 INFO L87 Difference]: Start difference. First operand 763 states and 963 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 14:33:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:45,181 INFO L93 Difference]: Finished difference Result 1087 states and 1360 transitions. [2024-11-18 14:33:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:45,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 102 [2024-11-18 14:33:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:45,183 INFO L225 Difference]: With dead ends: 1087 [2024-11-18 14:33:45,183 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 14:33:45,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:45,186 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:45,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 203 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 14:33:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 14:33:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 14:33:45,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-11-18 14:33:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:45,189 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 14:33:45,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 14:33:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 14:33:45,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 14:33:45,192 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:33:45,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 14:33:45,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:45,399 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:45,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 14:33:47,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:33:47,530 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify_threads contained old-variable. Original clause: (let ((.cse1 (= 2 |old(~c_dr_st~0)|))) (let ((.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 0)) (.cse7 (= ~c_dr_st~0 2)) (.cse8 (not .cse1)) (.cse0 (= ~c_dr_pc~0 0))) (and (or (and .cse0 .cse1) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse1) (and .cse4 .cse2 .cse5 (<= 2 |old(~p_dw_st~0)|) .cse6) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse0 (= ~p_num_write~0 1))) (or (not .cse2) (not .cse4) (not .cse5) (<= 2 ~p_dw_st~0) (not .cse6) (< |old(~p_dw_st~0)| 2)) (or .cse7 .cse8 (not .cse3)) (or .cse7 .cse8 (not .cse0))))) Eliminated clause: (exists ((|old(~c_dr_st~0)| Int) (|old(~p_dw_st~0)| Int)) (let ((.cse5 (= 2 |old(~c_dr_st~0)|))) (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_st~0 2)) (.cse8 (not .cse5)) (.cse4 (= ~c_dr_pc~0 0))) (and (or (< 1 ~p_dw_st~0) (not .cse0) (not .cse1) (not .cse2) (not .cse3) (< |old(~p_dw_st~0)| 2)) (or (and .cse4 .cse5) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse5) (and .cse1 .cse0 .cse2 (<= 2 |old(~p_dw_st~0)|) .cse3) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse6 .cse4 (= ~p_num_write~0 1))) (or .cse7 .cse8 (not .cse6)) (or .cse7 .cse8 (not .cse4)))))) [2024-11-18 14:33:47,544 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 14:33:47,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:33:47 BoogieIcfgContainer [2024-11-18 14:33:47,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:33:47,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:33:47,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:33:47,580 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:33:47,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:40" (3/4) ... [2024-11-18 14:33:47,586 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 14:33:47,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-11-18 14:33:47,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-18 14:33:47,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-18 14:33:47,596 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-18 14:33:47,596 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 14:33:47,597 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 14:33:47,597 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 14:33:47,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:33:47,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 14:33:47,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:33:47,702 INFO L158 Benchmark]: Toolchain (without parser) took 7952.41ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 139.6MB in the beginning and 174.8MB in the end (delta: -35.2MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,702 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:33:47,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.03ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 125.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.56ms. Allocated memory is still 169.9MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,703 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 169.9MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,704 INFO L158 Benchmark]: RCFGBuilder took 555.07ms. Allocated memory is still 169.9MB. Free memory was 121.5MB in the beginning and 128.3MB in the end (delta: -6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,704 INFO L158 Benchmark]: TraceAbstraction took 6831.41ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 127.8MB in the beginning and 181.1MB in the end (delta: -53.3MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,704 INFO L158 Benchmark]: Witness Printer took 121.85ms. Allocated memory is still 247.5MB. Free memory was 181.1MB in the beginning and 174.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 14:33:47,706 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.18ms. Allocated memory is still 169.9MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.03ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 125.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.56ms. Allocated memory is still 169.9MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.89ms. Allocated memory is still 169.9MB. Free memory was 123.6MB in the beginning and 121.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.07ms. Allocated memory is still 169.9MB. Free memory was 121.5MB in the beginning and 128.3MB in the end (delta: -6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6831.41ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 127.8MB in the beginning and 181.1MB in the end (delta: -53.3MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. * Witness Printer took 121.85ms. Allocated memory is still 247.5MB. Free memory was 181.1MB in the beginning and 174.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 879 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 879 mSDsluCounter, 3208 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1981 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 246 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1227 mSDtfsCounter, 246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=883occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 560 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 1886 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 234/323 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - InvariantResult [Line: 117]: Location Invariant Derived location invariant: ((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0))) || (((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0))) - InvariantResult [Line: 160]: Location Invariant Derived location invariant: ((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_last_read == p_last_write))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) - ProcedureContractResult [Line: 76]: Procedure Contract for immediate_notify_threads Derived contract for procedure immediate_notify_threads. Ensures: ((((((((c_dr_pc == 0) && (2 == \old(c_dr_st))) || ((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 == \old(c_dr_st)))) || (((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= \old(p_dw_st))) && (c_last_read == p_last_write))) || ((((((p_dw_pc == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_num_write == 1))) && (((((((1 < p_dw_st) || (p_last_write != q_buf_0)) || (c_num_read != p_num_write)) || (p_dw_st == 0)) || (q_free != 1)) || (c_last_read != p_last_write)) || (\old(p_dw_st) < 2))) && (((c_dr_st == 2) || (2 != \old(c_dr_st))) || (c_dr_pc != 0))) && (((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) - ProcedureContractResult [Line: 220]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: ((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) Ensures: (((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (2 <= p_dw_st)) || ((c_dr_st == 2) && (c_dr_pc == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0))) || (((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= p_dw_st))) || ((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (2 <= p_dw_st))) && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: (0 && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 14:33:47,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE