./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/nla-digbench-scaling/dijkstra-u_valuebound5.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 b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:56:09,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:56:09,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:56:09,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:56:09,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:56:09,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:56:09,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:56:09,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:56:09,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:56:09,365 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:56:09,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:56:09,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:56:09,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:56:09,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:56:09,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:56:09,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:56:09,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:56:09,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:56:09,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:56:09,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:56:09,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:56:09,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:56:09,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:56:09,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:56:09,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:56:09,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:56:09,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c [2025-03-08 04:56:09,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:56:09,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:56:09,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:56:09,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:56:09,586 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:56:09,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2025-03-08 04:56:10,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e35a21/5ff47a465ede4b5ba3901de3300fdab1/FLAG29c27af55 [2025-03-08 04:56:10,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:56:10,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2025-03-08 04:56:10,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e35a21/5ff47a465ede4b5ba3901de3300fdab1/FLAG29c27af55 [2025-03-08 04:56:11,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1e35a21/5ff47a465ede4b5ba3901de3300fdab1 [2025-03-08 04:56:11,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:56:11,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:56:11,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:56:11,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:56:11,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:56:11,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbc53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11, skipping insertion in model container [2025-03-08 04:56:11,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:56:11,311 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/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2025-03-08 04:56:11,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:56:11,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:56:11,351 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/nla-digbench-scaling/dijkstra-u_valuebound5.c[525,538] [2025-03-08 04:56:11,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:56:11,376 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:56:11,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11 WrapperNode [2025-03-08 04:56:11,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:56:11,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:56:11,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:56:11,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:56:11,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,408 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-08 04:56:11,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:56:11,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:56:11,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:56:11,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:56:11,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,428 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]. [2025-03-08 04:56:11,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:56:11,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:56:11,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:56:11,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:56:11,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (1/1) ... [2025-03-08 04:56:11,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:56:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:56:11,465 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) [2025-03-08 04:56:11,469 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 [2025-03-08 04:56:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:56:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 04:56:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 04:56:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:56:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:56:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:56:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:56:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:56:11,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:56:11,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:56:11,710 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 04:56:11,710 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:56:11,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:56:11,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:56:11,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:56:11 BoogieIcfgContainer [2025-03-08 04:56:11,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:56:11,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:56:11,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:56:11,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:56:11,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:56:11" (1/3) ... [2025-03-08 04:56:11,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634621d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:56:11, skipping insertion in model container [2025-03-08 04:56:11,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:56:11" (2/3) ... [2025-03-08 04:56:11,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634621d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:56:11, skipping insertion in model container [2025-03-08 04:56:11,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:56:11" (3/3) ... [2025-03-08 04:56:11,726 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2025-03-08 04:56:11,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:56:11,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_valuebound5.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:56:11,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:56:11,779 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;@732045d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:56:11,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:56:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:56:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:56:11,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:56:11,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:56:11,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:56:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:56:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1503588837, now seen corresponding path program 1 times [2025-03-08 04:56:11,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:56:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785824922] [2025-03-08 04:56:11,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:56:11,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:56:11,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:56:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:11,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:56:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:56:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785824922] [2025-03-08 04:56:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785824922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:56:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663525412] [2025-03-08 04:56:11,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:56:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:56:11,889 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) [2025-03-08 04:56:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:56:11,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:56:11,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:56:11,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:11,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:11,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 04:56:11,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:56:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:56:11,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:56:11,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663525412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:56:11,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:56:11,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 04:56:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889041148] [2025-03-08 04:56:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:56:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:56:11,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:56:11,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:56:11,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:56:11,970 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:56:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:56:11,986 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2025-03-08 04:56:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:56:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-08 04:56:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:56:11,991 INFO L225 Difference]: With dead ends: 59 [2025-03-08 04:56:11,992 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 04:56:11,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:56:12,001 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:56:12,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:56:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 04:56:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 04:56:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 04:56:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-03-08 04:56:12,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 18 [2025-03-08 04:56:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:56:12,029 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-08 04:56:12,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:56:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2025-03-08 04:56:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:56:12,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:56:12,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:56:12,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:56:12,231 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,SelfDestructingSolverStorable0 [2025-03-08 04:56:12,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:56:12,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:56:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -809424251, now seen corresponding path program 1 times [2025-03-08 04:56:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:56:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120279535] [2025-03-08 04:56:12,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:56:12,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:56:12,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:56:12,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:12,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:56:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120279535] [2025-03-08 04:56:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120279535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:56:12,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:56:12,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:56:12,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810623521] [2025-03-08 04:56:12,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:56:12,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:56:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:56:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:56:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:56:12,572 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:56:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:56:12,707 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2025-03-08 04:56:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:56:12,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-08 04:56:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:56:12,709 INFO L225 Difference]: With dead ends: 56 [2025-03-08 04:56:12,709 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 04:56:12,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:56:12,709 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:56:12,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:56:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 04:56:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 04:56:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 04:56:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-08 04:56:12,725 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 18 [2025-03-08 04:56:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:56:12,726 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-08 04:56:12,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:56:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-08 04:56:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:56:12,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:56:12,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:56:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:56:12,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:56:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:56:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 702201767, now seen corresponding path program 1 times [2025-03-08 04:56:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:56:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791389212] [2025-03-08 04:56:12,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:56:12,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:56:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:56:12,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:12,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:13,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:56:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791389212] [2025-03-08 04:56:13,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791389212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:56:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288908028] [2025-03-08 04:56:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:13,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:56:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:56:13,013 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) [2025-03-08 04:56:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:56:13,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:56:13,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:56:13,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:13,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:56:13,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:56:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:13,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:56:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288908028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:56:13,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:56:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 04:56:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139884602] [2025-03-08 04:56:13,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:56:13,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:56:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:56:13,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:56:13,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:56:13,265 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:56:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:56:14,311 INFO L93 Difference]: Finished difference Result 101 states and 167 transitions. [2025-03-08 04:56:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:56:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-08 04:56:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:56:14,313 INFO L225 Difference]: With dead ends: 101 [2025-03-08 04:56:14,313 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 04:56:14,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-08 04:56:14,314 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:56:14,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 175 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 04:56:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 04:56:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2025-03-08 04:56:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 04:56:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-03-08 04:56:14,328 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 19 [2025-03-08 04:56:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:56:14,329 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-03-08 04:56:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:56:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-03-08 04:56:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:56:14,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:56:14,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:56:14,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:56:14,532 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,SelfDestructingSolverStorable2 [2025-03-08 04:56:14,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:56:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:56:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -497181440, now seen corresponding path program 1 times [2025-03-08 04:56:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:56:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-03-08 04:56:14,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:56:14,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:56:14,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:56:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:56:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366724676] [2025-03-08 04:56:14,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:56:14,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:56:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:56:14,548 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) [2025-03-08 04:56:14,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:56:14,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:56:14,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:56:14,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:56:14,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:56:14,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 04:56:14,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:56:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:14,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:56:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:56:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:56:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926047474] [2025-03-08 04:56:15,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:56:15,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366724676] [2025-03-08 04:56:15,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366724676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:56:15,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:56:15,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-08 04:56:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599362325] [2025-03-08 04:56:15,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:56:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:56:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:56:15,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:56:15,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:56:15,964 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:56:20,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:25,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:29,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:34,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:38,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:42,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:46,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:48,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:52,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:56:56,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:57:00,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:57:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:57:01,272 INFO L93 Difference]: Finished difference Result 112 states and 178 transitions. [2025-03-08 04:57:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:57:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-08 04:57:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:57:01,274 INFO L225 Difference]: With dead ends: 112 [2025-03-08 04:57:01,274 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 04:57:01,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:57:01,275 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 55 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:57:01,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 244 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 195 Invalid, 9 Unknown, 0 Unchecked, 43.4s Time] [2025-03-08 04:57:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 04:57:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2025-03-08 04:57:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 39 states have internal predecessors, (45), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (47), 44 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 04:57:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2025-03-08 04:57:01,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 25 [2025-03-08 04:57:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:57:01,291 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2025-03-08 04:57:01,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:57:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2025-03-08 04:57:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:57:01,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:57:01,292 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:57:01,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:57:01,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:01,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:57:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:57:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 252907429, now seen corresponding path program 1 times [2025-03-08 04:57:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:57:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830671578] [2025-03-08 04:57:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:57:01,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 04:57:01,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:57:01,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:57:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033435859] [2025-03-08 04:57:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:57:01,511 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) [2025-03-08 04:57:01,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:57:01,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 04:57:01,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:57:01,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:01,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:57:01,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:57:01,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:57:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 04:57:01,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:57:01,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:57:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830671578] [2025-03-08 04:57:01,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:57:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033435859] [2025-03-08 04:57:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033435859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:57:01,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:57:01,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:57:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137788845] [2025-03-08 04:57:01,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:57:01,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:57:01,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:57:01,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:57:01,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:57:01,585 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:57:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:57:01,666 INFO L93 Difference]: Finished difference Result 114 states and 169 transitions. [2025-03-08 04:57:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:57:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-08 04:57:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:57:01,667 INFO L225 Difference]: With dead ends: 114 [2025-03-08 04:57:01,667 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 04:57:01,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:57:01,668 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:57:01,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:57:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 04:57:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 04:57:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-08 04:57:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2025-03-08 04:57:01,694 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 28 [2025-03-08 04:57:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:57:01,694 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2025-03-08 04:57:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:57:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2025-03-08 04:57:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:57:01,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:57:01,695 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:57:01,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:57:01,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:01,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:57:01,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:57:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -571138178, now seen corresponding path program 1 times [2025-03-08 04:57:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:57:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-03-08 04:57:01,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:57:01,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:57:01,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:57:01,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:01,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:57:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 04:57:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:57:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119293217] [2025-03-08 04:57:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119293217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:57:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219505242] [2025-03-08 04:57:02,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:57:02,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:57:02,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:57:02,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:57:02,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:57:02,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:02,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:57:02,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:57:02,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:57:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 04:57:02,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:57:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 04:57:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219505242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:57:02,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:57:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-08 04:57:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928892396] [2025-03-08 04:57:02,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:57:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:57:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:57:02,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:57:02,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:57:02,296 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 04:57:07,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:57:11,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:57:13,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:57:17,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:57:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:57:17,325 INFO L93 Difference]: Finished difference Result 159 states and 234 transitions. [2025-03-08 04:57:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 04:57:17,325 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2025-03-08 04:57:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:57:17,326 INFO L225 Difference]: With dead ends: 159 [2025-03-08 04:57:17,326 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 04:57:17,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:57:17,327 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 85 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:57:17,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 380 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 198 Invalid, 3 Unknown, 0 Unchecked, 15.0s Time] [2025-03-08 04:57:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 04:57:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2025-03-08 04:57:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-08 04:57:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2025-03-08 04:57:17,340 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 36 [2025-03-08 04:57:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:57:17,340 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2025-03-08 04:57:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 04:57:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2025-03-08 04:57:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 04:57:17,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:57:17,341 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 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] [2025-03-08 04:57:17,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:57:17,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:17,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:57:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:57:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1634073514, now seen corresponding path program 1 times [2025-03-08 04:57:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:57:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122681410] [2025-03-08 04:57:17,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:57:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 04:57:17,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 04:57:17,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:17,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:57:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 04:57:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:57:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122681410] [2025-03-08 04:57:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122681410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:57:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072511102] [2025-03-08 04:57:18,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:57:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:57:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:57:18,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:57:18,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:57:18,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 04:57:18,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 04:57:18,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:57:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:57:18,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 04:57:18,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:57:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:57:23,247 INFO L312 TraceCheckSpWp]: Computing backward predicates...