./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:50:24,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:50:24,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:50:24,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:50:24,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:50:24,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:50:24,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:50:24,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:50:24,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:50:24,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:50:24,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:50:24,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:50:24,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:50:24,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:50:24,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:50:24,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:50:24,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:50:24,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:50:24,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:50:24,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:24,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:50:24,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:50:24,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:50:24,293 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 [2025-03-16 22:50:24,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:50:24,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:50:24,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:50:24,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:50:24,519 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:50:24,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c [2025-03-16 22:50:25,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8264170/8ab1ab5f91aa44e5b6a25d8e95d66a35/FLAGca7e49401 [2025-03-16 22:50:25,919 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:50:25,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c [2025-03-16 22:50:25,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8264170/8ab1ab5f91aa44e5b6a25d8e95d66a35/FLAGca7e49401 [2025-03-16 22:50:26,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8264170/8ab1ab5f91aa44e5b6a25d8e95d66a35 [2025-03-16 22:50:26,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:50:26,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:50:26,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:26,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:50:26,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:50:26,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bb040f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26, skipping insertion in model container [2025-03-16 22:50:26,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:50:26,364 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c[1259,1272] [2025-03-16 22:50:26,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:26,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:50:26,615 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c[1259,1272] [2025-03-16 22:50:26,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:50:26,709 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:50:26,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26 WrapperNode [2025-03-16 22:50:26,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:50:26,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:26,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:50:26,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:50:26,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,909 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2162 [2025-03-16 22:50:26,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:50:26,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:50:26,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:50:26,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:50:26,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:26,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,005 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:50:27,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:50:27,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:50:27,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:50:27,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:50:27,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (1/1) ... [2025-03-16 22:50:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:50:27,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:27,178 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-16 22:50:27,183 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-16 22:50:27,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:50:27,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:50:27,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:50:27,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:50:27,427 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:50:27,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:50:29,089 INFO L? ?]: Removed 1353 outVars from TransFormulas that were not future-live. [2025-03-16 22:50:29,089 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:50:29,171 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:50:29,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:50:29,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:29 BoogieIcfgContainer [2025-03-16 22:50:29,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:50:29,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:50:29,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:50:29,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:50:29,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:50:26" (1/3) ... [2025-03-16 22:50:29,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d10ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:29, skipping insertion in model container [2025-03-16 22:50:29,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:50:26" (2/3) ... [2025-03-16 22:50:29,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d10ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:50:29, skipping insertion in model container [2025-03-16 22:50:29,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:50:29" (3/3) ... [2025-03-16 22:50:29,182 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p07.c [2025-03-16 22:50:29,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:50:29,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p07.c that has 1 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:50:29,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:50:29,242 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;@20a5ede2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:50:29,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:50:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 22:50:29,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:29,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:29,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:29,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1137222073, now seen corresponding path program 1 times [2025-03-16 22:50:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488117037] [2025-03-16 22:50:29,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:29,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 22:50:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 22:50:29,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:29,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:29,846 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-16 22:50:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488117037] [2025-03-16 22:50:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488117037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000833408] [2025-03-16 22:50:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:29,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:29,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:29,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:29,870 INFO L87 Difference]: Start difference. First operand has 545 states, 543 states have (on average 1.5009208103130756) internal successors, (815), 544 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:30,156 INFO L93 Difference]: Finished difference Result 1037 states and 1553 transitions. [2025-03-16 22:50:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 22:50:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:30,166 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 22:50:30,167 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 22:50:30,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:30,173 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:30,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2023 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:50:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 22:50:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 22:50:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 544 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 814 transitions. [2025-03-16 22:50:30,216 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 814 transitions. Word has length 50 [2025-03-16 22:50:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 814 transitions. [2025-03-16 22:50:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 814 transitions. [2025-03-16 22:50:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 22:50:30,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:30,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:30,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:50:30,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash -889465973, now seen corresponding path program 1 times [2025-03-16 22:50:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802666195] [2025-03-16 22:50:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:30,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 22:50:30,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 22:50:30,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:30,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:30,389 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-16 22:50:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802666195] [2025-03-16 22:50:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802666195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116484932] [2025-03-16 22:50:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:30,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:50:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:50:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:30,393 INFO L87 Difference]: Start difference. First operand 545 states and 814 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:30,634 INFO L93 Difference]: Finished difference Result 1039 states and 1552 transitions. [2025-03-16 22:50:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:50:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-16 22:50:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:30,637 INFO L225 Difference]: With dead ends: 1039 [2025-03-16 22:50:30,637 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 22:50:30,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:50:30,638 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:30,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:50:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 22:50:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 22:50:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4945054945054945) internal successors, (816), 546 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 816 transitions. [2025-03-16 22:50:30,660 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 816 transitions. Word has length 51 [2025-03-16 22:50:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:30,660 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 816 transitions. [2025-03-16 22:50:30,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 816 transitions. [2025-03-16 22:50:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 22:50:30,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:30,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:30,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:50:30,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:30,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash 127868610, now seen corresponding path program 1 times [2025-03-16 22:50:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593093963] [2025-03-16 22:50:30,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 22:50:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 22:50:30,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:31,008 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-16 22:50:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593093963] [2025-03-16 22:50:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593093963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:50:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331403014] [2025-03-16 22:50:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:50:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:31,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:50:31,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:31,010 INFO L87 Difference]: Start difference. First operand 547 states and 816 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:31,414 INFO L93 Difference]: Finished difference Result 1051 states and 1568 transitions. [2025-03-16 22:50:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:50:31,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 22:50:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:31,417 INFO L225 Difference]: With dead ends: 1051 [2025-03-16 22:50:31,417 INFO L226 Difference]: Without dead ends: 557 [2025-03-16 22:50:31,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:31,419 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 6 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4013 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:31,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4013 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-16 22:50:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 556. [2025-03-16 22:50:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.4936936936936938) internal successors, (829), 555 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 829 transitions. [2025-03-16 22:50:31,431 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 829 transitions. Word has length 52 [2025-03-16 22:50:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:31,432 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 829 transitions. [2025-03-16 22:50:31,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 829 transitions. [2025-03-16 22:50:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:50:31,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:31,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:50:31,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash 557224218, now seen corresponding path program 1 times [2025-03-16 22:50:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:31,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141801737] [2025-03-16 22:50:31,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:50:31,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:50:31,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:31,672 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-16 22:50:31,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:31,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141801737] [2025-03-16 22:50:31,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141801737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:31,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:31,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:31,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482794441] [2025-03-16 22:50:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:31,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:31,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:31,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:31,673 INFO L87 Difference]: Start difference. First operand 556 states and 829 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:31,934 INFO L93 Difference]: Finished difference Result 1069 states and 1594 transitions. [2025-03-16 22:50:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 22:50:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:31,936 INFO L225 Difference]: With dead ends: 1069 [2025-03-16 22:50:31,936 INFO L226 Difference]: Without dead ends: 566 [2025-03-16 22:50:31,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:31,937 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 8 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:31,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2690 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:50:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-16 22:50:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-16 22:50:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.4920353982300885) internal successors, (843), 565 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 843 transitions. [2025-03-16 22:50:31,946 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 843 transitions. Word has length 53 [2025-03-16 22:50:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 843 transitions. [2025-03-16 22:50:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 843 transitions. [2025-03-16 22:50:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:50:31,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:31,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:50:31,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:31,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1739856579, now seen corresponding path program 1 times [2025-03-16 22:50:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602555970] [2025-03-16 22:50:31,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:31,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:50:32,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:50:32,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:32,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:32,240 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-16 22:50:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:32,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602555970] [2025-03-16 22:50:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602555970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:50:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786499123] [2025-03-16 22:50:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:32,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:50:32,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:32,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:50:32,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:50:32,244 INFO L87 Difference]: Start difference. First operand 566 states and 843 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:32,418 INFO L93 Difference]: Finished difference Result 1079 states and 1607 transitions. [2025-03-16 22:50:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:50:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-16 22:50:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:32,420 INFO L225 Difference]: With dead ends: 1079 [2025-03-16 22:50:32,420 INFO L226 Difference]: Without dead ends: 566 [2025-03-16 22:50:32,421 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-16 22:50:32,421 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 2 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:32,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1345 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:50:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-16 22:50:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-16 22:50:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.488495575221239) internal successors, (841), 565 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2025-03-16 22:50:32,431 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 54 [2025-03-16 22:50:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2025-03-16 22:50:32,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2025-03-16 22:50:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:50:32,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:32,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:50:32,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1429887818, now seen corresponding path program 1 times [2025-03-16 22:50:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224373707] [2025-03-16 22:50:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:32,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:50:32,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:50:32,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:32,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:32,921 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-16 22:50:32,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:32,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224373707] [2025-03-16 22:50:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224373707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:32,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:32,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:50:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211346147] [2025-03-16 22:50:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:32,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:50:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:32,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:50:32,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:50:32,922 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:33,534 INFO L93 Difference]: Finished difference Result 1086 states and 1612 transitions. [2025-03-16 22:50:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:50:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 22:50:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:33,537 INFO L225 Difference]: With dead ends: 1086 [2025-03-16 22:50:33,537 INFO L226 Difference]: Without dead ends: 573 [2025-03-16 22:50:33,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:50:33,538 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 781 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:33,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 5310 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-16 22:50:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 570. [2025-03-16 22:50:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4868189806678382) internal successors, (846), 569 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 846 transitions. [2025-03-16 22:50:33,549 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 846 transitions. Word has length 55 [2025-03-16 22:50:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:33,550 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 846 transitions. [2025-03-16 22:50:33,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 846 transitions. [2025-03-16 22:50:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:50:33,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:33,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:50:33,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1726032348, now seen corresponding path program 1 times [2025-03-16 22:50:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782455065] [2025-03-16 22:50:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:33,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:50:33,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:50:33,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:33,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:33,756 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-16 22:50:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:33,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782455065] [2025-03-16 22:50:33,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782455065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:33,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:33,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069842410] [2025-03-16 22:50:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:33,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:33,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:33,758 INFO L87 Difference]: Start difference. First operand 570 states and 846 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:34,150 INFO L93 Difference]: Finished difference Result 1283 states and 1899 transitions. [2025-03-16 22:50:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:34,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 22:50:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:34,153 INFO L225 Difference]: With dead ends: 1283 [2025-03-16 22:50:34,153 INFO L226 Difference]: Without dead ends: 766 [2025-03-16 22:50:34,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:50:34,154 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 1337 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:34,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2643 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-16 22:50:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 576. [2025-03-16 22:50:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.4852173913043478) internal successors, (854), 575 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 854 transitions. [2025-03-16 22:50:34,164 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 854 transitions. Word has length 55 [2025-03-16 22:50:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:34,164 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 854 transitions. [2025-03-16 22:50:34,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 854 transitions. [2025-03-16 22:50:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 22:50:34,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:34,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:34,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:50:34,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1730828170, now seen corresponding path program 1 times [2025-03-16 22:50:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153206809] [2025-03-16 22:50:34,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:34,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 22:50:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 22:50:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:34,436 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-16 22:50:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153206809] [2025-03-16 22:50:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153206809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:34,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822690549] [2025-03-16 22:50:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:34,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:34,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:34,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:34,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:34,437 INFO L87 Difference]: Start difference. First operand 576 states and 854 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:34,733 INFO L93 Difference]: Finished difference Result 1330 states and 1966 transitions. [2025-03-16 22:50:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 22:50:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:34,735 INFO L225 Difference]: With dead ends: 1330 [2025-03-16 22:50:34,736 INFO L226 Difference]: Without dead ends: 807 [2025-03-16 22:50:34,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:34,737 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1066 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:34,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1989 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-03-16 22:50:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 622. [2025-03-16 22:50:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.4782608695652173) internal successors, (918), 621 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 918 transitions. [2025-03-16 22:50:34,747 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 918 transitions. Word has length 56 [2025-03-16 22:50:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 918 transitions. [2025-03-16 22:50:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 918 transitions. [2025-03-16 22:50:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 22:50:34,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:34,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:34,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:50:34,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 440202289, now seen corresponding path program 1 times [2025-03-16 22:50:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302340957] [2025-03-16 22:50:34,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:34,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 22:50:34,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 22:50:34,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:35,396 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-16 22:50:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:35,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302340957] [2025-03-16 22:50:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302340957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:35,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:35,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:50:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407157275] [2025-03-16 22:50:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:35,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:50:35,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:35,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:50:35,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:35,398 INFO L87 Difference]: Start difference. First operand 622 states and 918 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:36,004 INFO L93 Difference]: Finished difference Result 1326 states and 1959 transitions. [2025-03-16 22:50:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:50:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 22:50:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:36,007 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 22:50:36,007 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 22:50:36,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:50:36,008 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 1374 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:36,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 3927 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 22:50:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 626. [2025-03-16 22:50:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-03-16 22:50:36,018 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 57 [2025-03-16 22:50:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:36,018 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-03-16 22:50:36,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-03-16 22:50:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 22:50:36,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:36,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:50:36,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -894295524, now seen corresponding path program 1 times [2025-03-16 22:50:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797242278] [2025-03-16 22:50:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:36,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 22:50:36,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 22:50:36,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:36,293 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-16 22:50:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797242278] [2025-03-16 22:50:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797242278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:36,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082410990] [2025-03-16 22:50:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:36,294 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:36,654 INFO L93 Difference]: Finished difference Result 1181 states and 1740 transitions. [2025-03-16 22:50:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 22:50:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:36,657 INFO L225 Difference]: With dead ends: 1181 [2025-03-16 22:50:36,657 INFO L226 Difference]: Without dead ends: 634 [2025-03-16 22:50:36,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:50:36,658 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 781 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:36,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2643 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-16 22:50:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 626. [2025-03-16 22:50:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-03-16 22:50:36,668 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 57 [2025-03-16 22:50:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:36,669 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-03-16 22:50:36,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-03-16 22:50:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 22:50:36,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:36,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:36,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:50:36,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:36,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1847623674, now seen corresponding path program 1 times [2025-03-16 22:50:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156949747] [2025-03-16 22:50:36,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:36,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 22:50:36,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:50:36,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:36,884 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-16 22:50:36,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:36,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156949747] [2025-03-16 22:50:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156949747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:36,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:36,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:50:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298904348] [2025-03-16 22:50:36,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:36,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:50:36,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:36,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:50:36,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:36,887 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:37,403 INFO L93 Difference]: Finished difference Result 1396 states and 2051 transitions. [2025-03-16 22:50:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:37,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 22:50:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:37,406 INFO L225 Difference]: With dead ends: 1396 [2025-03-16 22:50:37,406 INFO L226 Difference]: Without dead ends: 849 [2025-03-16 22:50:37,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:50:37,407 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 1057 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:37,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 3184 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:50:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-03-16 22:50:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 626. [2025-03-16 22:50:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4768) internal successors, (923), 625 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 923 transitions. [2025-03-16 22:50:37,420 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 923 transitions. Word has length 58 [2025-03-16 22:50:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 923 transitions. [2025-03-16 22:50:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 923 transitions. [2025-03-16 22:50:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 22:50:37,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:37,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:37,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:50:37,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2105834726, now seen corresponding path program 1 times [2025-03-16 22:50:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264791031] [2025-03-16 22:50:37,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 22:50:37,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 22:50:37,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:37,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:37,559 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-16 22:50:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264791031] [2025-03-16 22:50:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264791031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:37,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356288029] [2025-03-16 22:50:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:37,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:37,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:37,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:37,562 INFO L87 Difference]: Start difference. First operand 626 states and 923 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:37,960 INFO L93 Difference]: Finished difference Result 1308 states and 1925 transitions. [2025-03-16 22:50:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:37,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 22:50:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:37,962 INFO L225 Difference]: With dead ends: 1308 [2025-03-16 22:50:37,962 INFO L226 Difference]: Without dead ends: 747 [2025-03-16 22:50:37,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:37,964 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 256 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:37,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2475 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-16 22:50:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 626. [2025-03-16 22:50:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 1.4736) internal successors, (921), 625 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 921 transitions. [2025-03-16 22:50:37,976 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 921 transitions. Word has length 59 [2025-03-16 22:50:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 921 transitions. [2025-03-16 22:50:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 921 transitions. [2025-03-16 22:50:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 22:50:37,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:37,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:50:37,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:37,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 327470790, now seen corresponding path program 1 times [2025-03-16 22:50:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830763069] [2025-03-16 22:50:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:37,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 22:50:38,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 22:50:38,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:38,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:38,134 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-16 22:50:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830763069] [2025-03-16 22:50:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830763069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722395300] [2025-03-16 22:50:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:38,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:38,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:38,136 INFO L87 Difference]: Start difference. First operand 626 states and 921 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:38,442 INFO L93 Difference]: Finished difference Result 1272 states and 1873 transitions. [2025-03-16 22:50:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 22:50:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:38,445 INFO L225 Difference]: With dead ends: 1272 [2025-03-16 22:50:38,445 INFO L226 Difference]: Without dead ends: 707 [2025-03-16 22:50:38,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:38,446 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 232 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:38,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 2576 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:50:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-16 22:50:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 601. [2025-03-16 22:50:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4766666666666666) internal successors, (886), 600 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 886 transitions. [2025-03-16 22:50:38,454 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 886 transitions. Word has length 60 [2025-03-16 22:50:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 886 transitions. [2025-03-16 22:50:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 886 transitions. [2025-03-16 22:50:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-16 22:50:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:38,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:38,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:50:38,461 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1993169362, now seen corresponding path program 1 times [2025-03-16 22:50:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655805628] [2025-03-16 22:50:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-16 22:50:40,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-16 22:50:40,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655805628] [2025-03-16 22:50:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655805628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837553070] [2025-03-16 22:50:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:42,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:42,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:42,544 INFO L87 Difference]: Start difference. First operand 601 states and 886 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:42,967 INFO L93 Difference]: Finished difference Result 1284 states and 1898 transitions. [2025-03-16 22:50:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:50:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2025-03-16 22:50:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:42,970 INFO L225 Difference]: With dead ends: 1284 [2025-03-16 22:50:42,970 INFO L226 Difference]: Without dead ends: 761 [2025-03-16 22:50:42,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:50:42,971 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 1299 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:42,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 1874 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-16 22:50:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 609. [2025-03-16 22:50:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.4703947368421053) internal successors, (894), 608 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 894 transitions. [2025-03-16 22:50:42,981 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 894 transitions. Word has length 303 [2025-03-16 22:50:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 894 transitions. [2025-03-16 22:50:42,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 894 transitions. [2025-03-16 22:50:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-16 22:50:42,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:42,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:42,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:50:42,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:42,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:42,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1200268548, now seen corresponding path program 1 times [2025-03-16 22:50:42,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:42,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764259950] [2025-03-16 22:50:42,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:43,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-16 22:50:44,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-16 22:50:44,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:44,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:46,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764259950] [2025-03-16 22:50:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764259950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:50:46,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:50:46,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:50:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006138748] [2025-03-16 22:50:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:50:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:50:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:46,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:50:46,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:50:46,187 INFO L87 Difference]: Start difference. First operand 609 states and 894 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:46,591 INFO L93 Difference]: Finished difference Result 1284 states and 1897 transitions. [2025-03-16 22:50:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:50:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 304 [2025-03-16 22:50:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:46,594 INFO L225 Difference]: With dead ends: 1284 [2025-03-16 22:50:46,594 INFO L226 Difference]: Without dead ends: 761 [2025-03-16 22:50:46,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:50:46,595 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1270 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:46,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1886 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:50:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-16 22:50:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 610. [2025-03-16 22:50:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.4696223316912973) internal successors, (895), 609 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2025-03-16 22:50:46,607 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 304 [2025-03-16 22:50:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:46,607 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2025-03-16 22:50:46,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2025-03-16 22:50:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-16 22:50:46,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:46,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:50:46,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash -580819574, now seen corresponding path program 1 times [2025-03-16 22:50:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822307413] [2025-03-16 22:50:46,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:46,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-16 22:50:49,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-16 22:50:49,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:49,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:50:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822307413] [2025-03-16 22:50:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822307413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:50:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440161786] [2025-03-16 22:50:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:50:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:50:51,106 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-16 22:50:51,107 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-16 22:50:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-16 22:50:52,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-16 22:50:52,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:52,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:50:52,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 22:50:52,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:50:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:53,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:50:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:50:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440161786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:50:54,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:50:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2025-03-16 22:50:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303913135] [2025-03-16 22:50:54,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:50:54,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 22:50:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:50:54,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 22:50:54,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:50:54,895 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:50:55,773 INFO L93 Difference]: Finished difference Result 1850 states and 2735 transitions. [2025-03-16 22:50:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:50:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2025-03-16 22:50:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:50:55,777 INFO L225 Difference]: With dead ends: 1850 [2025-03-16 22:50:55,777 INFO L226 Difference]: Without dead ends: 1327 [2025-03-16 22:50:55,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:50:55,779 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 4002 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4002 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:50:55,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4002 Valid, 3124 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:50:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-03-16 22:50:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1045. [2025-03-16 22:50:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4770114942528736) internal successors, (1542), 1044 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1542 transitions. [2025-03-16 22:50:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1542 transitions. Word has length 305 [2025-03-16 22:50:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:50:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1542 transitions. [2025-03-16 22:50:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 49.833333333333336) internal successors, (897), 17 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:50:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1542 transitions. [2025-03-16 22:50:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-16 22:50:55,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:50:55,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:50:55,812 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-16 22:50:55,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 22:50:55,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:50:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:50:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1730730397, now seen corresponding path program 1 times [2025-03-16 22:50:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:50:56,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015762397] [2025-03-16 22:50:56,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:50:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:50:56,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-16 22:50:58,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-16 22:50:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:50:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015762397] [2025-03-16 22:51:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015762397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:51:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145865868] [2025-03-16 22:51:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:01,150 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-16 22:51:01,151 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-16 22:51:01,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-16 22:51:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-16 22:51:02,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:02,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:02,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-16 22:51:02,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:51:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:02,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:51:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145865868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:02,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:51:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-03-16 22:51:02,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401099371] [2025-03-16 22:51:02,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:51:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:02,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:51:02,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:51:02,617 INFO L87 Difference]: Start difference. First operand 1045 states and 1542 transitions. Second operand has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:03,249 INFO L93 Difference]: Finished difference Result 2212 states and 3255 transitions. [2025-03-16 22:51:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:51:03,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2025-03-16 22:51:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:03,252 INFO L225 Difference]: With dead ends: 2212 [2025-03-16 22:51:03,253 INFO L226 Difference]: Without dead ends: 1254 [2025-03-16 22:51:03,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:51:03,254 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 1102 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:03,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 3108 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:51:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-16 22:51:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1144. [2025-03-16 22:51:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.4601924759405074) internal successors, (1669), 1143 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1669 transitions. [2025-03-16 22:51:03,270 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1669 transitions. Word has length 306 [2025-03-16 22:51:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1669 transitions. [2025-03-16 22:51:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.0) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1669 transitions. [2025-03-16 22:51:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 22:51:03,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:03,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:51:03,474 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,SelfDestructingSolverStorable16 [2025-03-16 22:51:03,475 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1266251843, now seen corresponding path program 1 times [2025-03-16 22:51:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238533237] [2025-03-16 22:51:03,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:03,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 22:51:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 22:51:05,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:05,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238533237] [2025-03-16 22:51:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238533237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:51:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786469628] [2025-03-16 22:51:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:06,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:51:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:06,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:51:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:51:06,004 INFO L87 Difference]: Start difference. First operand 1144 states and 1669 transitions. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:06,733 INFO L93 Difference]: Finished difference Result 2278 states and 3340 transitions. [2025-03-16 22:51:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:51:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-16 22:51:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:06,737 INFO L225 Difference]: With dead ends: 2278 [2025-03-16 22:51:06,737 INFO L226 Difference]: Without dead ends: 1249 [2025-03-16 22:51:06,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:51:06,738 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 965 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:06,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 3451 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:51:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-16 22:51:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1144. [2025-03-16 22:51:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.458442694663167) internal successors, (1667), 1143 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1667 transitions. [2025-03-16 22:51:06,752 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1667 transitions. Word has length 307 [2025-03-16 22:51:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:06,752 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1667 transitions. [2025-03-16 22:51:06,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 7 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1667 transitions. [2025-03-16 22:51:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 22:51:06,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:06,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:51:06,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1819333550, now seen corresponding path program 1 times [2025-03-16 22:51:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707089377] [2025-03-16 22:51:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:06,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 22:51:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 22:51:08,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:08,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 22:51:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707089377] [2025-03-16 22:51:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707089377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:51:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987577034] [2025-03-16 22:51:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:09,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:51:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:09,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:51:09,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:51:09,266 INFO L87 Difference]: Start difference. First operand 1144 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:09,564 INFO L93 Difference]: Finished difference Result 2344 states and 3424 transitions. [2025-03-16 22:51:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:51:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-16 22:51:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:09,567 INFO L225 Difference]: With dead ends: 2344 [2025-03-16 22:51:09,567 INFO L226 Difference]: Without dead ends: 1287 [2025-03-16 22:51:09,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:51:09,569 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 234 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:09,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 2481 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:51:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-03-16 22:51:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1144. [2025-03-16 22:51:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.457567804024497) internal successors, (1666), 1143 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1666 transitions. [2025-03-16 22:51:09,581 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1666 transitions. Word has length 307 [2025-03-16 22:51:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1666 transitions. [2025-03-16 22:51:09,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1666 transitions. [2025-03-16 22:51:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 22:51:09,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:09,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:09,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:51:09,584 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1207055896, now seen corresponding path program 1 times [2025-03-16 22:51:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575250873] [2025-03-16 22:51:09,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 22:51:11,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 22:51:11,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:11,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575250873] [2025-03-16 22:51:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575250873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:51:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060061146] [2025-03-16 22:51:14,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:14,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:14,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:14,899 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-16 22:51:14,900 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-16 22:51:15,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 22:51:16,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 22:51:16,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:16,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 2521 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 22:51:16,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:51:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:16,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:51:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060061146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:51:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-03-16 22:51:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133607327] [2025-03-16 22:51:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:51:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:51:16,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:51:16,707 INFO L87 Difference]: Start difference. First operand 1144 states and 1666 transitions. Second operand has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:17,193 INFO L93 Difference]: Finished difference Result 2555 states and 3754 transitions. [2025-03-16 22:51:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:51:17,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2025-03-16 22:51:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:17,197 INFO L225 Difference]: With dead ends: 2555 [2025-03-16 22:51:17,197 INFO L226 Difference]: Without dead ends: 1528 [2025-03-16 22:51:17,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-16 22:51:17,198 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 1322 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:17,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 2290 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:51:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-16 22:51:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1154. [2025-03-16 22:51:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4553339115351258) internal successors, (1678), 1153 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1678 transitions. [2025-03-16 22:51:17,214 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1678 transitions. Word has length 308 [2025-03-16 22:51:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:17,215 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1678 transitions. [2025-03-16 22:51:17,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1678 transitions. [2025-03-16 22:51:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 22:51:17,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:17,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:17,232 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-16 22:51:17,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:17,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:17,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1485462360, now seen corresponding path program 1 times [2025-03-16 22:51:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000986906] [2025-03-16 22:51:17,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 22:51:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 22:51:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000986906] [2025-03-16 22:51:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000986906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:51:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:51:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:51:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976912106] [2025-03-16 22:51:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:51:20,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:51:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:51:20,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:51:20,191 INFO L87 Difference]: Start difference. First operand 1154 states and 1678 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:51:20,656 INFO L93 Difference]: Finished difference Result 2195 states and 3208 transitions. [2025-03-16 22:51:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:51:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-03-16 22:51:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:51:20,659 INFO L225 Difference]: With dead ends: 2195 [2025-03-16 22:51:20,659 INFO L226 Difference]: Without dead ends: 1158 [2025-03-16 22:51:20,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:51:20,660 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 714 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:51:20,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2133 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:51:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-03-16 22:51:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2025-03-16 22:51:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.4545454545454546) internal successors, (1680), 1155 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1680 transitions. [2025-03-16 22:51:20,672 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1680 transitions. Word has length 309 [2025-03-16 22:51:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:51:20,672 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1680 transitions. [2025-03-16 22:51:20,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 5 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:51:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1680 transitions. [2025-03-16 22:51:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 22:51:20,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:51:20,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:51:20,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 22:51:20,675 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:51:20,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:51:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -34294461, now seen corresponding path program 1 times [2025-03-16 22:51:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:51:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961042938] [2025-03-16 22:51:20,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:51:20,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 22:51:24,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 22:51:24,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:51:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961042938] [2025-03-16 22:51:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961042938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:51:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406490347] [2025-03-16 22:51:27,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:51:27,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:51:27,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:51:27,161 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-16 22:51:27,162 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-16 22:51:27,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 22:51:28,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 22:51:28,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:51:28,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:51:28,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-16 22:51:28,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:51:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:30,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:51:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:51:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406490347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:51:37,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:51:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24, 21] total 52 [2025-03-16 22:51:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750460078] [2025-03-16 22:51:37,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:51:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 22:51:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:51:37,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 22:51:37,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2503, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 22:51:37,018 INFO L87 Difference]: Start difference. First operand 1156 states and 1680 transitions. Second operand has 53 states, 53 states have (on average 15.415094339622641) internal successors, (817), 52 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)