./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/sorting_selectionsort_2_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/array-examples/sorting_selectionsort_2_ground.i -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 cae1888d2d961d86748cda3b827a90e6d152bf2b6038710fc1a5581289f20b0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 08:58:54,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 08:58:54,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 08:58:54,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 08:58:54,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 08:58:54,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 08:58:54,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 08:58:54,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 08:58:54,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 08:58:54,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 08:58:54,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 08:58:54,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 08:58:54,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 08:58:54,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 08:58:54,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 08:58:54,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 08:58:54,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 08:58:54,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 08:58:54,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 08:58:54,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:54,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 08:58:54,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 08:58:54,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 08:58:54,309 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 -> cae1888d2d961d86748cda3b827a90e6d152bf2b6038710fc1a5581289f20b0c [2025-03-03 08:58:54,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 08:58:54,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 08:58:54,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 08:58:54,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 08:58:54,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 08:58:54,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sorting_selectionsort_2_ground.i [2025-03-03 08:58:55,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2067a73cf/69a4665172a148e09dfc848ff69abe01/FLAG8f5d4a363 [2025-03-03 08:58:55,951 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 08:58:55,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sorting_selectionsort_2_ground.i [2025-03-03 08:58:55,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2067a73cf/69a4665172a148e09dfc848ff69abe01/FLAG8f5d4a363 [2025-03-03 08:58:55,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2067a73cf/69a4665172a148e09dfc848ff69abe01 [2025-03-03 08:58:55,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 08:58:55,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 08:58:55,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:55,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 08:58:55,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 08:58:55,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:55" (1/1) ... [2025-03-03 08:58:56,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea67d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:58:55" (1/1) ... [2025-03-03 08:58:56,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 08:58:56,116 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/array-examples/sorting_selectionsort_2_ground.i[823,836] [2025-03-03 08:58:56,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 08:58:56,152 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/array-examples/sorting_selectionsort_2_ground.i[823,836] [2025-03-03 08:58:56,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 08:58:56,179 INFO L204 MainTranslator]: Completed translation [2025-03-03 08:58:56,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56 WrapperNode [2025-03-03 08:58:56,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 08:58:56,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 08:58:56,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 08:58:56,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,201 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2025-03-03 08:58:56,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 08:58:56,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 08:58:56,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 08:58:56,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,216 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-03 08:58:56,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 08:58:56,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 08:58:56,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 08:58:56,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 08:58:56,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (1/1) ... [2025-03-03 08:58:56,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 08:58:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:56,249 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-03 08:58:56,254 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-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 08:58:56,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 08:58:56,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 08:58:56,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 08:58:56,311 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 08:58:56,313 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 08:58:56,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-03 08:58:56,493 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 08:58:56,495 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 08:58:56,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 08:58:56,503 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 08:58:56,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56 BoogieIcfgContainer [2025-03-03 08:58:56,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 08:58:56,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 08:58:56,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 08:58:56,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 08:58:56,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:58:55" (1/3) ... [2025-03-03 08:58:56,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbe05d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:58:56" (2/3) ... [2025-03-03 08:58:56,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbe05d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:58:56, skipping insertion in model container [2025-03-03 08:58:56,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:58:56" (3/3) ... [2025-03-03 08:58:56,512 INFO L128 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_2_ground.i [2025-03-03 08:58:56,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 08:58:56,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sorting_selectionsort_2_ground.i that has 2 procedures, 29 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-03 08:58:56,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 08:58:56,566 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;@732fe1cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 08:58:56,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 08:58:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 08:58:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 08:58:56,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:56,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:56,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1055744568, now seen corresponding path program 1 times [2025-03-03 08:58:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822504306] [2025-03-03 08:58:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:56,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 08:58:56,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 08:58:56,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822504306] [2025-03-03 08:58:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822504306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:56,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 08:58:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389359984] [2025-03-03 08:58:56,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:56,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 08:58:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:56,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 08:58:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 08:58:56,756 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:56,827 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2025-03-03 08:58:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 08:58:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 08:58:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:56,836 INFO L225 Difference]: With dead ends: 69 [2025-03-03 08:58:56,836 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 08:58:56,839 INFO L434 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 [2025-03-03 08:58:56,843 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:56,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 08:58:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2025-03-03 08:58:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 08:58:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-03 08:58:56,876 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 10 [2025-03-03 08:58:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:56,877 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-03 08:58:56,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-03 08:58:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 08:58:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:56,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:56,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 08:58:56,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1616886517, now seen corresponding path program 1 times [2025-03-03 08:58:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000571299] [2025-03-03 08:58:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:56,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 08:58:56,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 08:58:56,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:56,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000571299] [2025-03-03 08:58:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000571299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721122876] [2025-03-03 08:58:56,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:56,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:56,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:56,989 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-03 08:58:56,991 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-03 08:58:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 08:58:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 08:58:57,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 08:58:57,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 08:58:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721122876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:57,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 08:58:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618664995] [2025-03-03 08:58:57,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 08:58:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 08:58:57,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:58:57,106 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,202 INFO L93 Difference]: Finished difference Result 94 states and 145 transitions. [2025-03-03 08:58:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 08:58:57,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 08:58:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,204 INFO L225 Difference]: With dead ends: 94 [2025-03-03 08:58:57,204 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 08:58:57,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 08:58:57,205 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 111 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 80 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:58:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 08:58:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 08:58:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 08:58:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2025-03-03 08:58:57,220 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 14 [2025-03-03 08:58:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,220 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-03-03 08:58:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2025-03-03 08:58:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 08:58:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,222 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 08:58:57,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 108243667, now seen corresponding path program 2 times [2025-03-03 08:58:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864541407] [2025-03-03 08:58:57,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 08:58:57,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 17 statements. [2025-03-03 08:58:57,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:58:57,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:58:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864541407] [2025-03-03 08:58:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864541407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:57,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:57,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789728516] [2025-03-03 08:58:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:57,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:57,517 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:57,582 INFO L93 Difference]: Finished difference Result 132 states and 201 transitions. [2025-03-03 08:58:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:57,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 08:58:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:57,585 INFO L225 Difference]: With dead ends: 132 [2025-03-03 08:58:57,585 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 08:58:57,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 08:58:57,586 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:57,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 08:58:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-03 08:58:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 08:58:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2025-03-03 08:58:57,594 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 17 [2025-03-03 08:58:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:57,594 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2025-03-03 08:58:57,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2025-03-03 08:58:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 08:58:57,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:57,595 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:57,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 08:58:57,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:57,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 620308152, now seen corresponding path program 1 times [2025-03-03 08:58:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176394430] [2025-03-03 08:58:57,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:57,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 08:58:57,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 08:58:57,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 08:58:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176394430] [2025-03-03 08:58:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176394430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56205607] [2025-03-03 08:58:57,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:57,681 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-03 08:58:57,683 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-03 08:58:57,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 08:58:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 08:58:57,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:57,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:57,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 08:58:57,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56205607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:57,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 08:58:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816690769] [2025-03-03 08:58:57,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 08:58:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:57,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 08:58:57,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-03 08:58:57,849 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:58,389 INFO L93 Difference]: Finished difference Result 298 states and 476 transitions. [2025-03-03 08:58:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 08:58:58,390 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 08:58:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:58,391 INFO L225 Difference]: With dead ends: 298 [2025-03-03 08:58:58,391 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 08:58:58,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=580, Invalid=1312, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 08:58:58,392 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 725 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:58,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 144 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 08:58:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 08:58:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 214. [2025-03-03 08:58:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.4921465968586387) internal successors, (285), 191 states have internal predecessors, (285), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 08:58:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2025-03-03 08:58:58,413 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 20 [2025-03-03 08:58:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:58,413 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2025-03-03 08:58:58,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2025-03-03 08:58:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 08:58:58,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:58,414 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:58,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 08:58:58,614 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,SelfDestructingSolverStorable3 [2025-03-03 08:58:58,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash -784372009, now seen corresponding path program 1 times [2025-03-03 08:58:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:58,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001532429] [2025-03-03 08:58:58,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:58,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:58:58,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:58:58,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 08:58:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001532429] [2025-03-03 08:58:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001532429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:58:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9157333] [2025-03-03 08:58:58,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:58,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:58:58,719 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-03 08:58:58,721 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-03 08:58:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 08:58:58,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 08:58:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:58,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 08:58:58,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:58:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:58,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:58:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 08:58:59,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9157333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:58:59,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:58:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 27 [2025-03-03 08:58:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221401580] [2025-03-03 08:58:59,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 08:58:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 08:58:59,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2025-03-03 08:58:59,087 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,522 INFO L93 Difference]: Finished difference Result 665 states and 1050 transitions. [2025-03-03 08:58:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 08:58:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 08:58:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,525 INFO L225 Difference]: With dead ends: 665 [2025-03-03 08:58:59,525 INFO L226 Difference]: Without dead ends: 464 [2025-03-03 08:58:59,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=485, Unknown=0, NotChecked=0, Total=870 [2025-03-03 08:58:59,527 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 985 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 322 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 08:58:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-03 08:58:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2025-03-03 08:58:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 411 states have (on average 1.491484184914842) internal successors, (613), 411 states have internal predecessors, (613), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 08:58:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 703 transitions. [2025-03-03 08:58:59,556 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 703 transitions. Word has length 26 [2025-03-03 08:58:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 703 transitions. [2025-03-03 08:58:59,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 703 transitions. [2025-03-03 08:58:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 08:58:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,557 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,563 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-03 08:58:59,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:58:59,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1625459443, now seen corresponding path program 2 times [2025-03-03 08:58:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93274104] [2025-03-03 08:58:59,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:58:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:59,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 08:58:59,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 41 statements. [2025-03-03 08:58:59,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 08:58:59,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:58:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-03-03 08:58:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:58:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93274104] [2025-03-03 08:58:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93274104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 08:58:59,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 08:58:59,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 08:58:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170963887] [2025-03-03 08:58:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 08:58:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 08:58:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:58:59,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 08:58:59,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:59,817 INFO L87 Difference]: Start difference. First operand 458 states and 703 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:58:59,850 INFO L93 Difference]: Finished difference Result 872 states and 1353 transitions. [2025-03-03 08:58:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 08:58:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 08:58:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:58:59,852 INFO L225 Difference]: With dead ends: 872 [2025-03-03 08:58:59,852 INFO L226 Difference]: Without dead ends: 455 [2025-03-03 08:58:59,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 08:58:59,854 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:58:59,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 08:58:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-03 08:58:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-03 08:58:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 409 states have (on average 1.488997555012225) internal successors, (609), 409 states have internal predecessors, (609), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 08:58:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 697 transitions. [2025-03-03 08:58:59,877 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 697 transitions. Word has length 41 [2025-03-03 08:58:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:58:59,877 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 697 transitions. [2025-03-03 08:58:59,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:58:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 697 transitions. [2025-03-03 08:58:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 08:58:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:58:59,878 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:58:59,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 08:58:59,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:58:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:58:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1477636501, now seen corresponding path program 1 times [2025-03-03 08:58:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:58:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735056849] [2025-03-03 08:58:59,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:58:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:58:59,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 08:58:59,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 08:58:59,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:58:59,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735056849] [2025-03-03 08:59:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735056849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660001587] [2025-03-03 08:59:00,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 08:59:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:00,377 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-03 08:59:00,378 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-03 08:59:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 08:59:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 08:59:00,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 08:59:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:00,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 08:59:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:00,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660001587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:01,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-03 08:59:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419194173] [2025-03-03 08:59:01,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 08:59:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 08:59:01,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 08:59:01,138 INFO L87 Difference]: Start difference. First operand 455 states and 697 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:02,187 INFO L93 Difference]: Finished difference Result 1365 states and 2160 transitions. [2025-03-03 08:59:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 08:59:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 08:59:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:02,192 INFO L225 Difference]: With dead ends: 1365 [2025-03-03 08:59:02,192 INFO L226 Difference]: Without dead ends: 935 [2025-03-03 08:59:02,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 08:59:02,194 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2221 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:02,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 537 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 08:59:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-03 08:59:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2025-03-03 08:59:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 841 states have (on average 1.4946492271105827) internal successors, (1257), 841 states have internal predecessors, (1257), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 08:59:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1441 transitions. [2025-03-03 08:59:02,239 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1441 transitions. Word has length 41 [2025-03-03 08:59:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1441 transitions. [2025-03-03 08:59:02,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1441 transitions. [2025-03-03 08:59:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 08:59:02,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:02,242 INFO L218 NwaCegarLoop]: trace histogram [46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:02,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:02,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:02,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -953596779, now seen corresponding path program 2 times [2025-03-03 08:59:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:02,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305473828] [2025-03-03 08:59:02,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:02,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:02,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-03 08:59:02,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 08:59:02,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305473828] [2025-03-03 08:59:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305473828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310748103] [2025-03-03 08:59:03,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 08:59:03,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:03,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:03,739 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-03 08:59:03,741 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-03 08:59:03,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-03 08:59:03,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 08:59:03,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 08:59:03,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:03,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 08:59:03,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:03,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 08:59:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310748103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:05,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-03 08:59:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541323568] [2025-03-03 08:59:05,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:05,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-03 08:59:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:05,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-03 08:59:05,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 08:59:05,821 INFO L87 Difference]: Start difference. First operand 935 states and 1441 transitions. Second operand has 97 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 97 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:11,037 INFO L93 Difference]: Finished difference Result 2781 states and 4416 transitions. [2025-03-03 08:59:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 08:59:11,037 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 97 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 08:59:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:11,045 INFO L225 Difference]: With dead ends: 2781 [2025-03-03 08:59:11,045 INFO L226 Difference]: Without dead ends: 1895 [2025-03-03 08:59:11,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 08:59:11,049 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4922 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5109 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:11,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5109 Valid, 957 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 08:59:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-03 08:59:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1895. [2025-03-03 08:59:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1705 states have (on average 1.4973607038123167) internal successors, (2553), 1705 states have internal predecessors, (2553), 188 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 188 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-03 08:59:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2929 transitions. [2025-03-03 08:59:11,126 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2929 transitions. Word has length 65 [2025-03-03 08:59:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:11,127 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2929 transitions. [2025-03-03 08:59:11,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 97 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2929 transitions. [2025-03-03 08:59:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 08:59:11,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:11,128 INFO L218 NwaCegarLoop]: trace histogram [94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:11,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 08:59:11,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:11,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:11,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -985994603, now seen corresponding path program 3 times [2025-03-03 08:59:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321128713] [2025-03-03 08:59:11,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:11,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 48 equivalence classes. [2025-03-03 08:59:11,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 113 statements. [2025-03-03 08:59:11,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2025-03-03 08:59:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321128713] [2025-03-03 08:59:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321128713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711486175] [2025-03-03 08:59:11,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 08:59:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:11,415 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-03 08:59:11,416 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-03 08:59:11,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 48 equivalence classes. [2025-03-03 08:59:11,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 113 statements. [2025-03-03 08:59:11,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 08:59:11,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 08:59:11,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2025-03-03 08:59:11,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4470 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2025-03-03 08:59:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711486175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:11,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-03 08:59:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882994065] [2025-03-03 08:59:11,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:11,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 08:59:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:11,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 08:59:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 08:59:11,594 INFO L87 Difference]: Start difference. First operand 1895 states and 2929 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 08:59:11,739 INFO L93 Difference]: Finished difference Result 3714 states and 5798 transitions. [2025-03-03 08:59:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 08:59:11,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-03 08:59:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 08:59:11,749 INFO L225 Difference]: With dead ends: 3714 [2025-03-03 08:59:11,749 INFO L226 Difference]: Without dead ends: 1929 [2025-03-03 08:59:11,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2025-03-03 08:59:11,753 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 08:59:11,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 191 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 08:59:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-03-03 08:59:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2025-03-03 08:59:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1739 states have (on average 1.493387004025302) internal successors, (2597), 1739 states have internal predecessors, (2597), 188 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 188 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-03 08:59:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2973 transitions. [2025-03-03 08:59:11,810 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2973 transitions. Word has length 113 [2025-03-03 08:59:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 08:59:11,811 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2973 transitions. [2025-03-03 08:59:11,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 08:59:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2973 transitions. [2025-03-03 08:59:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 08:59:11,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 08:59:11,812 INFO L218 NwaCegarLoop]: trace histogram [94, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 08:59:11,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 08:59:12,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:12,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 08:59:12,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 08:59:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1890043477, now seen corresponding path program 4 times [2025-03-03 08:59:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 08:59:12,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747751367] [2025-03-03 08:59:12,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 08:59:12,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 125 statements into 2 equivalence classes. [2025-03-03 08:59:12,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 08:59:12,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 08:59:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4516 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2025-03-03 08:59:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 08:59:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747751367] [2025-03-03 08:59:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747751367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 08:59:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310156924] [2025-03-03 08:59:12,292 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 08:59:12,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 08:59:12,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 08:59:12,294 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 08:59:12,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 08:59:12,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 125 statements into 2 equivalence classes. [2025-03-03 08:59:12,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 08:59:12,491 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 08:59:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 08:59:12,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-03 08:59:12,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 08:59:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4516 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 08:59:15,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 08:59:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4516 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 08:59:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310156924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 08:59:21,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 08:59:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 97, 97] total 199 [2025-03-03 08:59:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118632156] [2025-03-03 08:59:21,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 08:59:21,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 199 states [2025-03-03 08:59:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 08:59:21,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2025-03-03 08:59:21,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18371, Invalid=21031, Unknown=0, NotChecked=0, Total=39402 [2025-03-03 08:59:21,725 INFO L87 Difference]: Start difference. First operand 1929 states and 2973 transitions. Second operand has 199 states, 199 states have (on average 1.1457286432160805) internal successors, (228), 199 states have internal predecessors, (228), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:00:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:00:29,917 INFO L93 Difference]: Finished difference Result 5783 states and 9178 transitions. [2025-03-03 09:00:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2025-03-03 09:00:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 199 states, 199 states have (on average 1.1457286432160805) internal successors, (228), 199 states have internal predecessors, (228), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-03 09:00:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:00:29,932 INFO L225 Difference]: With dead ends: 5783 [2025-03-03 09:00:29,933 INFO L226 Difference]: Without dead ends: 3951 [2025-03-03 09:00:29,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=24083, Invalid=27219, Unknown=0, NotChecked=0, Total=51302 [2025-03-03 09:00:29,940 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12056 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12435 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:00:29,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12435 Valid, 1925 Invalid, 3700 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1100 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 09:00:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-03 09:00:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3925. [2025-03-03 09:00:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3543 states have (on average 1.4916737228337567) internal successors, (5285), 3543 states have internal predecessors, (5285), 380 states have call successors, (380), 1 states have call predecessors, (380), 1 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2025-03-03 09:00:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6045 transitions. [2025-03-03 09:00:30,034 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6045 transitions. Word has length 125 [2025-03-03 09:00:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:00:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 6045 transitions. [2025-03-03 09:00:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 199 states, 199 states have (on average 1.1457286432160805) internal successors, (228), 199 states have internal predecessors, (228), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:00:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6045 transitions. [2025-03-03 09:00:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 09:00:30,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:00:30,040 INFO L218 NwaCegarLoop]: trace histogram [190, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:00:30,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:00:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:00:30,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:00:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:00:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -775528326, now seen corresponding path program 5 times [2025-03-03 09:00:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:00:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674167731] [2025-03-03 09:00:30,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:00:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:00:30,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 224 statements into 96 equivalence classes. [2025-03-03 09:00:33,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 09:00:33,578 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2025-03-03 09:00:33,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat