./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.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_QF_BV_vMiim_p1.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 c13079d4927c37ef7c4e12e861d352aca7538cf90caea314288bdceb904b4d72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:47:26,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:47:26,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:47:26,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:47:26,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:47:26,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:47:26,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:47:26,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:47:26,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:47:26,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:47:26,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:47:26,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:47:26,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:47:26,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:47:26,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:47:26,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:47:26,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:47:26,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:47:26,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:47:26,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:47:26,487 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 -> c13079d4927c37ef7c4e12e861d352aca7538cf90caea314288bdceb904b4d72 [2025-03-16 22:47:26,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:47:26,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:47:26,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:47:26,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:47:26,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:47:26,733 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_QF_BV_vMiim_p1.c [2025-03-16 22:47:27,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b41aa85c/279ba17fed2a47a3b5ac93e2ba97709a/FLAG3f6c6a7b4 [2025-03-16 22:47:28,174 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:47:28,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c [2025-03-16 22:47:28,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b41aa85c/279ba17fed2a47a3b5ac93e2ba97709a/FLAG3f6c6a7b4 [2025-03-16 22:47:28,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b41aa85c/279ba17fed2a47a3b5ac93e2ba97709a [2025-03-16 22:47:28,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:47:28,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:47:28,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:47:28,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:47:28,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:47:28,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28, skipping insertion in model container [2025-03-16 22:47:28,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:47:28,360 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_QF_BV_vMiim_p1.c[1258,1271] [2025-03-16 22:47:28,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:47:28,505 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:47:28,511 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_QF_BV_vMiim_p1.c[1258,1271] [2025-03-16 22:47:28,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:47:28,595 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:47:28,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28 WrapperNode [2025-03-16 22:47:28,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:47:28,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:47:28,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:47:28,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:47:28,601 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:47:28" (1/1) ... [2025-03-16 22:47:28,631 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:47:28" (1/1) ... [2025-03-16 22:47:28,747 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1475 [2025-03-16 22:47:28,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:47:28,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:47:28,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:47:28,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:47:28,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,813 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:47:28,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:47:28,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:47:28,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:47:28,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:47:28,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (1/1) ... [2025-03-16 22:47:28,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:47:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:47:28,956 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:47:28,962 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:47:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:47:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:47:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:47:28,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:47:29,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:47:29,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:47:30,233 INFO L? ?]: Removed 721 outVars from TransFormulas that were not future-live. [2025-03-16 22:47:30,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:47:30,291 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:47:30,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:47:30,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:47:30 BoogieIcfgContainer [2025-03-16 22:47:30,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:47:30,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:47:30,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:47:30,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:47:30,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:47:28" (1/3) ... [2025-03-16 22:47:30,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b032288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:47:30, skipping insertion in model container [2025-03-16 22:47:30,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:47:28" (2/3) ... [2025-03-16 22:47:30,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b032288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:47:30, skipping insertion in model container [2025-03-16 22:47:30,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:47:30" (3/3) ... [2025-03-16 22:47:30,301 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c [2025-03-16 22:47:30,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:47:30,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c that has 1 procedures, 344 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:47:30,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:47:30,360 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;@2658b9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:47:30,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:47:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 342 states have (on average 1.5) internal successors, (513), 343 states have internal predecessors, (513), 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:47:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 22:47:30,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:30,370 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, 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:47:30,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:30,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash -205512100, now seen corresponding path program 1 times [2025-03-16 22:47:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153847878] [2025-03-16 22:47:30,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 22:47:30,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 22:47:30,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:30,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:31,363 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:47:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153847878] [2025-03-16 22:47:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153847878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:31,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:47:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955318004] [2025-03-16 22:47:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:47:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:31,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:47:31,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:47:31,388 INFO L87 Difference]: Start difference. First operand has 344 states, 342 states have (on average 1.5) internal successors, (513), 343 states have internal predecessors, (513), 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 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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:47:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:31,918 INFO L93 Difference]: Finished difference Result 588 states and 880 transitions. [2025-03-16 22:47:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:47:31,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2025-03-16 22:47:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:31,930 INFO L225 Difference]: With dead ends: 588 [2025-03-16 22:47:31,930 INFO L226 Difference]: Without dead ends: 369 [2025-03-16 22:47:31,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:47:31,936 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 512 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:31,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2443 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-16 22:47:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2025-03-16 22:47:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.4904632152588555) internal successors, (547), 367 states have internal predecessors, (547), 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:47:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 547 transitions. [2025-03-16 22:47:31,984 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 547 transitions. Word has length 84 [2025-03-16 22:47:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:31,984 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 547 transitions. [2025-03-16 22:47:31,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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:47:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 547 transitions. [2025-03-16 22:47:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 22:47:31,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:31,986 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, 1, 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:47:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:47:31,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2026632265, now seen corresponding path program 1 times [2025-03-16 22:47:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739207364] [2025-03-16 22:47:31,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:32,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 22:47:32,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 22:47:32,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:32,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:32,280 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:47:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739207364] [2025-03-16 22:47:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739207364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:32,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:47:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011853905] [2025-03-16 22:47:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:32,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:47:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:32,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:47:32,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:47:32,286 INFO L87 Difference]: Start difference. First operand 368 states and 547 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:47:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:32,448 INFO L93 Difference]: Finished difference Result 372 states and 551 transitions. [2025-03-16 22:47:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:47:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-03-16 22:47:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:32,450 INFO L225 Difference]: With dead ends: 372 [2025-03-16 22:47:32,450 INFO L226 Difference]: Without dead ends: 370 [2025-03-16 22:47:32,450 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:47:32,451 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:32,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1267 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:47:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-16 22:47:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-16 22:47:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 369 states have internal predecessors, (549), 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:47:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 549 transitions. [2025-03-16 22:47:32,473 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 549 transitions. Word has length 85 [2025-03-16 22:47:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:32,473 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 549 transitions. [2025-03-16 22:47:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:47:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 549 transitions. [2025-03-16 22:47:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 22:47:32,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:32,477 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, 1, 1, 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:47:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:47:32,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1594229774, now seen corresponding path program 1 times [2025-03-16 22:47:32,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:32,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029580749] [2025-03-16 22:47:32,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:32,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 22:47:32,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 22:47:32,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:32,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:32,651 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:47:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029580749] [2025-03-16 22:47:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029580749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:47:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115448052] [2025-03-16 22:47:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:47:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:32,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:47:32,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:47:32,653 INFO L87 Difference]: Start difference. First operand 370 states and 549 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:47:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:32,814 INFO L93 Difference]: Finished difference Result 591 states and 877 transitions. [2025-03-16 22:47:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:47:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-03-16 22:47:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:32,816 INFO L225 Difference]: With dead ends: 591 [2025-03-16 22:47:32,816 INFO L226 Difference]: Without dead ends: 372 [2025-03-16 22:47:32,817 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:47:32,818 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:32,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1264 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:47:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-16 22:47:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-16 22:47:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.4851752021563343) internal successors, (551), 371 states have internal predecessors, (551), 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:47:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 551 transitions. [2025-03-16 22:47:32,827 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 551 transitions. Word has length 86 [2025-03-16 22:47:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:32,827 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 551 transitions. [2025-03-16 22:47:32,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:47:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 551 transitions. [2025-03-16 22:47:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:47:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:32,833 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, 1, 1, 1, 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:47:32,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:47:32,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -244973212, now seen corresponding path program 1 times [2025-03-16 22:47:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:32,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108263577] [2025-03-16 22:47:32,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:32,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:47:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:47:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:33,230 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:47:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:33,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108263577] [2025-03-16 22:47:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108263577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:47:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457387558] [2025-03-16 22:47:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:33,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:47:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:33,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:47:33,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:47:33,233 INFO L87 Difference]: Start difference. First operand 372 states and 551 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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:47:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:33,688 INFO L93 Difference]: Finished difference Result 601 states and 890 transitions. [2025-03-16 22:47:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:47:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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 87 [2025-03-16 22:47:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:33,690 INFO L225 Difference]: With dead ends: 601 [2025-03-16 22:47:33,692 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 22:47:33,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:47:33,694 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 517 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:33,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 2430 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 22:47:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-03-16 22:47:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.4854111405835544) internal successors, (560), 377 states have internal predecessors, (560), 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:47:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 560 transitions. [2025-03-16 22:47:33,704 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 560 transitions. Word has length 87 [2025-03-16 22:47:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 560 transitions. [2025-03-16 22:47:33,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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:47:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 560 transitions. [2025-03-16 22:47:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:47:33,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:33,705 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, 1, 1, 1, 1, 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:47:33,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:47:33,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:33,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 894690968, now seen corresponding path program 1 times [2025-03-16 22:47:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996327692] [2025-03-16 22:47:33,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:33,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:47:33,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:47:33,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:33,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:34,005 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:47:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996327692] [2025-03-16 22:47:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996327692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:47:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719017097] [2025-03-16 22:47:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:47:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:34,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:47:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:47:34,009 INFO L87 Difference]: Start difference. First operand 378 states and 560 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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:47:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:34,387 INFO L93 Difference]: Finished difference Result 600 states and 888 transitions. [2025-03-16 22:47:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:47:34,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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 88 [2025-03-16 22:47:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:34,389 INFO L225 Difference]: With dead ends: 600 [2025-03-16 22:47:34,390 INFO L226 Difference]: Without dead ends: 378 [2025-03-16 22:47:34,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:47:34,391 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 513 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:34,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2446 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-16 22:47:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2025-03-16 22:47:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4840425531914894) internal successors, (558), 376 states have internal predecessors, (558), 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:47:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 558 transitions. [2025-03-16 22:47:34,411 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 558 transitions. Word has length 88 [2025-03-16 22:47:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:34,411 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 558 transitions. [2025-03-16 22:47:34,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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:47:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 558 transitions. [2025-03-16 22:47:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:47:34,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:34,413 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, 1, 1, 1, 1, 1, 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:47:34,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:47:34,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:34,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -94956267, now seen corresponding path program 1 times [2025-03-16 22:47:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178934450] [2025-03-16 22:47:34,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:34,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:47:34,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:47:34,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:34,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:35,039 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:47:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178934450] [2025-03-16 22:47:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178934450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:47:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8290456] [2025-03-16 22:47:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:47:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:35,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:47:35,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:35,042 INFO L87 Difference]: Start difference. First operand 377 states and 558 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 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:47:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:35,691 INFO L93 Difference]: Finished difference Result 604 states and 893 transitions. [2025-03-16 22:47:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:47:35,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 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 89 [2025-03-16 22:47:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:35,694 INFO L225 Difference]: With dead ends: 604 [2025-03-16 22:47:35,694 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 22:47:35,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:47:35,696 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 536 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:35,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 3226 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:47:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 22:47:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2025-03-16 22:47:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.481578947368421) internal successors, (563), 380 states have internal predecessors, (563), 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:47:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 563 transitions. [2025-03-16 22:47:35,713 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 563 transitions. Word has length 89 [2025-03-16 22:47:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:35,714 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 563 transitions. [2025-03-16 22:47:35,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 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:47:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 563 transitions. [2025-03-16 22:47:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 22:47:35,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:35,715 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, 1, 1, 1, 1, 1, 1, 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:47:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:47:35,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1250248967, now seen corresponding path program 1 times [2025-03-16 22:47:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713304426] [2025-03-16 22:47:35,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:35,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 22:47:35,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 22:47:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:35,924 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:47:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713304426] [2025-03-16 22:47:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713304426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:35,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:35,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:47:35,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604852243] [2025-03-16 22:47:35,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:47:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:35,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:47:35,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:35,926 INFO L87 Difference]: Start difference. First operand 381 states and 563 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 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:47:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:36,256 INFO L93 Difference]: Finished difference Result 805 states and 1186 transitions. [2025-03-16 22:47:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:47:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 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 90 [2025-03-16 22:47:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:36,258 INFO L225 Difference]: With dead ends: 805 [2025-03-16 22:47:36,258 INFO L226 Difference]: Without dead ends: 568 [2025-03-16 22:47:36,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:36,259 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1068 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:36,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 2033 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-16 22:47:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 382. [2025-03-16 22:47:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4776902887139107) internal successors, (563), 381 states have internal predecessors, (563), 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:47:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 563 transitions. [2025-03-16 22:47:36,268 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 563 transitions. Word has length 90 [2025-03-16 22:47:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 563 transitions. [2025-03-16 22:47:36,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 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:47:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 563 transitions. [2025-03-16 22:47:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:47:36,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:36,269 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, 1, 1, 1, 1, 1, 1, 1, 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:47:36,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:47:36,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:36,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1440191678, now seen corresponding path program 1 times [2025-03-16 22:47:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203191836] [2025-03-16 22:47:36,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:47:36,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:47:36,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:36,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:36,463 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:47:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:36,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203191836] [2025-03-16 22:47:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203191836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:36,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:47:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984517256] [2025-03-16 22:47:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:47:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:36,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:47:36,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:36,466 INFO L87 Difference]: Start difference. First operand 382 states and 563 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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:47:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:36,750 INFO L93 Difference]: Finished difference Result 655 states and 958 transitions. [2025-03-16 22:47:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:47:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2025-03-16 22:47:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:36,753 INFO L225 Difference]: With dead ends: 655 [2025-03-16 22:47:36,753 INFO L226 Difference]: Without dead ends: 413 [2025-03-16 22:47:36,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:36,755 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 598 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:36,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 2048 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:47:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-16 22:47:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 383. [2025-03-16 22:47:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.4738219895287958) internal successors, (563), 382 states have internal predecessors, (563), 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:47:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 563 transitions. [2025-03-16 22:47:36,764 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 563 transitions. Word has length 91 [2025-03-16 22:47:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:36,764 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 563 transitions. [2025-03-16 22:47:36,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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:47:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 563 transitions. [2025-03-16 22:47:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:47:36,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:36,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:47:36,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2003516254, now seen corresponding path program 1 times [2025-03-16 22:47:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404131223] [2025-03-16 22:47:36,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:47:36,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:47:36,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:37,002 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:47:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404131223] [2025-03-16 22:47:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404131223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:37,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:37,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:47:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630906245] [2025-03-16 22:47:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:37,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:47:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:37,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:47:37,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:37,004 INFO L87 Difference]: Start difference. First operand 383 states and 563 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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:47:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:37,303 INFO L93 Difference]: Finished difference Result 685 states and 1000 transitions. [2025-03-16 22:47:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:47:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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 92 [2025-03-16 22:47:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:37,311 INFO L225 Difference]: With dead ends: 685 [2025-03-16 22:47:37,311 INFO L226 Difference]: Without dead ends: 438 [2025-03-16 22:47:37,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:37,312 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 668 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:37,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2043 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-16 22:47:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 384. [2025-03-16 22:47:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4699738903394255) internal successors, (563), 383 states have internal predecessors, (563), 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:47:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 563 transitions. [2025-03-16 22:47:37,324 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 563 transitions. Word has length 92 [2025-03-16 22:47:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:37,324 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 563 transitions. [2025-03-16 22:47:37,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 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:47:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 563 transitions. [2025-03-16 22:47:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 22:47:37,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:37,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:47:37,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:37,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -31584605, now seen corresponding path program 1 times [2025-03-16 22:47:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:37,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413675904] [2025-03-16 22:47:37,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:37,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 22:47:37,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 22:47:37,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:37,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:37,600 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:47:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413675904] [2025-03-16 22:47:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413675904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:37,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:47:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195400960] [2025-03-16 22:47:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:37,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:47:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:37,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:47:37,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:37,603 INFO L87 Difference]: Start difference. First operand 384 states and 563 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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:47:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:37,948 INFO L93 Difference]: Finished difference Result 827 states and 1210 transitions. [2025-03-16 22:47:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:47:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2025-03-16 22:47:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:37,951 INFO L225 Difference]: With dead ends: 827 [2025-03-16 22:47:37,952 INFO L226 Difference]: Without dead ends: 575 [2025-03-16 22:47:37,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:37,953 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1074 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:37,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2048 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-16 22:47:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 385. [2025-03-16 22:47:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.4661458333333333) internal successors, (563), 384 states have internal predecessors, (563), 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:47:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 563 transitions. [2025-03-16 22:47:37,962 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 563 transitions. Word has length 93 [2025-03-16 22:47:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:37,962 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 563 transitions. [2025-03-16 22:47:37,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 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:47:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 563 transitions. [2025-03-16 22:47:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 22:47:37,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:37,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:47:37,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash -568438467, now seen corresponding path program 1 times [2025-03-16 22:47:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:37,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160172205] [2025-03-16 22:47:37,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:37,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 22:47:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 22:47:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:38,102 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:47:38,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:38,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160172205] [2025-03-16 22:47:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160172205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:38,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:47:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180257600] [2025-03-16 22:47:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:38,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:47:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:38,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:47:38,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:47:38,103 INFO L87 Difference]: Start difference. First operand 385 states and 563 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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:47:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:38,315 INFO L93 Difference]: Finished difference Result 798 states and 1170 transitions. [2025-03-16 22:47:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:47:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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 94 [2025-03-16 22:47:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:38,317 INFO L225 Difference]: With dead ends: 798 [2025-03-16 22:47:38,317 INFO L226 Difference]: Without dead ends: 546 [2025-03-16 22:47:38,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:38,318 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1025 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:38,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1239 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:47:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-16 22:47:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 365. [2025-03-16 22:47:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4697802197802199) internal successors, (535), 364 states have internal predecessors, (535), 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:47:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 535 transitions. [2025-03-16 22:47:38,328 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 535 transitions. Word has length 94 [2025-03-16 22:47:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 535 transitions. [2025-03-16 22:47:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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:47:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 535 transitions. [2025-03-16 22:47:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 22:47:38,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:38,333 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:38,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:47:38,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2075185168, now seen corresponding path program 1 times [2025-03-16 22:47:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313641492] [2025-03-16 22:47:38,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:38,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:38,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 22:47:38,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 22:47:38,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:38,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313641492] [2025-03-16 22:47:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313641492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:47:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349761457] [2025-03-16 22:47:38,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:47:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:47:38,841 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:47:38,843 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:47:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 22:47:39,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 22:47:39,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:39,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:39,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 22:47:39,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:47:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:39,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:47:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349761457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:47:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 22:47:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662443387] [2025-03-16 22:47:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:39,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:47:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:39,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:47:39,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:39,613 INFO L87 Difference]: Start difference. First operand 365 states and 535 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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:47:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:39,940 INFO L93 Difference]: Finished difference Result 585 states and 861 transitions. [2025-03-16 22:47:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:47:39,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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 196 [2025-03-16 22:47:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:39,942 INFO L225 Difference]: With dead ends: 585 [2025-03-16 22:47:39,942 INFO L226 Difference]: Without dead ends: 364 [2025-03-16 22:47:39,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:47:39,943 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 388 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:39,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 512 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-16 22:47:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-16 22:47:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.465564738292011) internal successors, (532), 363 states have internal predecessors, (532), 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:47:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 532 transitions. [2025-03-16 22:47:39,951 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 532 transitions. Word has length 196 [2025-03-16 22:47:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:39,951 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 532 transitions. [2025-03-16 22:47:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 3 states have internal predecessors, (196), 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:47:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 532 transitions. [2025-03-16 22:47:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 22:47:39,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:39,954 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:39,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:47:40,154 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,SelfDestructingSolverStorable11 [2025-03-16 22:47:40,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 877727139, now seen corresponding path program 1 times [2025-03-16 22:47:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727755314] [2025-03-16 22:47:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:40,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 22:47:40,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 22:47:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727755314] [2025-03-16 22:47:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727755314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:40,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:40,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:47:40,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745808232] [2025-03-16 22:47:40,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:40,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:47:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:40,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:47:40,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:47:40,958 INFO L87 Difference]: Start difference. First operand 364 states and 532 transitions. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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:47:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:41,353 INFO L93 Difference]: Finished difference Result 704 states and 1031 transitions. [2025-03-16 22:47:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:47:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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 197 [2025-03-16 22:47:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:41,357 INFO L225 Difference]: With dead ends: 704 [2025-03-16 22:47:41,357 INFO L226 Difference]: Without dead ends: 476 [2025-03-16 22:47:41,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:47:41,358 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 787 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:41,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1475 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-16 22:47:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 430. [2025-03-16 22:47:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.4638694638694638) internal successors, (628), 429 states have internal predecessors, (628), 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:47:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 628 transitions. [2025-03-16 22:47:41,366 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 628 transitions. Word has length 197 [2025-03-16 22:47:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 628 transitions. [2025-03-16 22:47:41,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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:47:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 628 transitions. [2025-03-16 22:47:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 22:47:41,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:41,368 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:47:41,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1255298431, now seen corresponding path program 1 times [2025-03-16 22:47:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061704219] [2025-03-16 22:47:41,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:41,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 22:47:41,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 22:47:41,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:41,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061704219] [2025-03-16 22:47:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061704219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:47:42,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893692492] [2025-03-16 22:47:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:47:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:42,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:47:42,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:47:42,040 INFO L87 Difference]: Start difference. First operand 430 states and 628 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 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:47:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:42,577 INFO L93 Difference]: Finished difference Result 834 states and 1216 transitions. [2025-03-16 22:47:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:47:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 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 198 [2025-03-16 22:47:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:42,579 INFO L225 Difference]: With dead ends: 834 [2025-03-16 22:47:42,579 INFO L226 Difference]: Without dead ends: 614 [2025-03-16 22:47:42,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:47:42,580 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 985 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1417 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:47:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-16 22:47:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 541. [2025-03-16 22:47:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.4666666666666666) internal successors, (792), 540 states have internal predecessors, (792), 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:47:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 792 transitions. [2025-03-16 22:47:42,590 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 792 transitions. Word has length 198 [2025-03-16 22:47:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 792 transitions. [2025-03-16 22:47:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 5 states have internal predecessors, (198), 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:47:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 792 transitions. [2025-03-16 22:47:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-16 22:47:42,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:42,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:47:42,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2126600945, now seen corresponding path program 1 times [2025-03-16 22:47:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419126811] [2025-03-16 22:47:42,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:42,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-16 22:47:42,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-16 22:47:42,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:42,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419126811] [2025-03-16 22:47:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419126811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:47:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545885154] [2025-03-16 22:47:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:43,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:47:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:43,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:47:43,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:47:43,299 INFO L87 Difference]: Start difference. First operand 541 states and 792 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:47:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:43,793 INFO L93 Difference]: Finished difference Result 763 states and 1119 transitions. [2025-03-16 22:47:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:47:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-03-16 22:47:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:43,796 INFO L225 Difference]: With dead ends: 763 [2025-03-16 22:47:43,796 INFO L226 Difference]: Without dead ends: 543 [2025-03-16 22:47:43,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:43,797 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 899 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:43,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 742 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:47:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-16 22:47:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2025-03-16 22:47:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.465804066543438) internal successors, (793), 541 states have internal predecessors, (793), 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:47:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 793 transitions. [2025-03-16 22:47:43,805 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 793 transitions. Word has length 199 [2025-03-16 22:47:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 793 transitions. [2025-03-16 22:47:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:47:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 793 transitions. [2025-03-16 22:47:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 22:47:43,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:43,807 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:47:43,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:43,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2019890703, now seen corresponding path program 1 times [2025-03-16 22:47:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637654594] [2025-03-16 22:47:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:43,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 22:47:44,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 22:47:44,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:44,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637654594] [2025-03-16 22:47:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637654594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:47:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281122855] [2025-03-16 22:47:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:47:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:47:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:47:44,449 INFO L87 Difference]: Start difference. First operand 542 states and 793 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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:47:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:44,917 INFO L93 Difference]: Finished difference Result 872 states and 1279 transitions. [2025-03-16 22:47:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:47:44,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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 200 [2025-03-16 22:47:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:44,919 INFO L225 Difference]: With dead ends: 872 [2025-03-16 22:47:44,919 INFO L226 Difference]: Without dead ends: 542 [2025-03-16 22:47:44,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:47:44,921 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 760 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:44,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 749 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-16 22:47:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-16 22:47:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4639556377079483) internal successors, (792), 541 states have internal predecessors, (792), 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:47:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 792 transitions. [2025-03-16 22:47:44,930 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 792 transitions. Word has length 200 [2025-03-16 22:47:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:44,930 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 792 transitions. [2025-03-16 22:47:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 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:47:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 792 transitions. [2025-03-16 22:47:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 22:47:44,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:44,932 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:44,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:47:44,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:44,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 906617609, now seen corresponding path program 1 times [2025-03-16 22:47:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756950223] [2025-03-16 22:47:44,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:44,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 22:47:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 22:47:45,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756950223] [2025-03-16 22:47:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756950223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:47:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270135032] [2025-03-16 22:47:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:47:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:47,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:47:47,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:47:47,050 INFO L87 Difference]: Start difference. First operand 542 states and 792 transitions. Second operand has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 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:47:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:47,497 INFO L93 Difference]: Finished difference Result 962 states and 1401 transitions. [2025-03-16 22:47:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:47:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 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 201 [2025-03-16 22:47:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:47,500 INFO L225 Difference]: With dead ends: 962 [2025-03-16 22:47:47,500 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 22:47:47,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-16 22:47:47,501 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 1097 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:47,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 2056 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:47:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 22:47:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 651. [2025-03-16 22:47:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.4476923076923076) internal successors, (941), 650 states have internal predecessors, (941), 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:47:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 941 transitions. [2025-03-16 22:47:47,514 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 941 transitions. Word has length 201 [2025-03-16 22:47:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:47,514 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 941 transitions. [2025-03-16 22:47:47,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.1) internal successors, (201), 9 states have internal predecessors, (201), 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:47:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 941 transitions. [2025-03-16 22:47:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 22:47:47,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:47,516 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:47,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:47:47,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:47,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash -938650599, now seen corresponding path program 1 times [2025-03-16 22:47:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:47,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278627414] [2025-03-16 22:47:47,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:47,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 22:47:47,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 22:47:47,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:47,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278627414] [2025-03-16 22:47:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278627414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:47:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513315029] [2025-03-16 22:47:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:49,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:47:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:47:49,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:47:49,647 INFO L87 Difference]: Start difference. First operand 651 states and 941 transitions. Second operand has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 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:47:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:50,125 INFO L93 Difference]: Finished difference Result 1035 states and 1504 transitions. [2025-03-16 22:47:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:47:50,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 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 202 [2025-03-16 22:47:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:50,127 INFO L225 Difference]: With dead ends: 1035 [2025-03-16 22:47:50,127 INFO L226 Difference]: Without dead ends: 736 [2025-03-16 22:47:50,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:47:50,128 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1537 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:50,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 2204 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-16 22:47:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2025-03-16 22:47:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4475138121546962) internal successors, (1048), 724 states have internal predecessors, (1048), 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:47:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1048 transitions. [2025-03-16 22:47:50,139 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1048 transitions. Word has length 202 [2025-03-16 22:47:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:50,139 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1048 transitions. [2025-03-16 22:47:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 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:47:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1048 transitions. [2025-03-16 22:47:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 22:47:50,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:50,141 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:47:50,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:50,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1862275427, now seen corresponding path program 1 times [2025-03-16 22:47:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314357855] [2025-03-16 22:47:50,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:50,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 22:47:50,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 22:47:50,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:50,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314357855] [2025-03-16 22:47:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314357855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:47:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438956049] [2025-03-16 22:47:52,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:47:52,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:47:52,616 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:47:52,619 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:47:52,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 22:47:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 22:47:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:53,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 22:47:53,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:47:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:53,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:47:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438956049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:47:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 19 [2025-03-16 22:47:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470609663] [2025-03-16 22:47:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:53,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:47:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:53,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:47:53,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:47:53,884 INFO L87 Difference]: Start difference. First operand 725 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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:47:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:54,386 INFO L93 Difference]: Finished difference Result 1169 states and 1698 transitions. [2025-03-16 22:47:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:47:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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 202 [2025-03-16 22:47:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:54,389 INFO L225 Difference]: With dead ends: 1169 [2025-03-16 22:47:54,389 INFO L226 Difference]: Without dead ends: 651 [2025-03-16 22:47:54,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:47:54,390 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 731 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:54,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 744 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:47:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-16 22:47:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2025-03-16 22:47:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.4415384615384614) internal successors, (937), 650 states have internal predecessors, (937), 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:47:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 937 transitions. [2025-03-16 22:47:54,398 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 937 transitions. Word has length 202 [2025-03-16 22:47:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:54,399 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 937 transitions. [2025-03-16 22:47:54,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 states have internal predecessors, (202), 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:47:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 937 transitions. [2025-03-16 22:47:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-16 22:47:54,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:54,400 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:54,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:47:54,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:47:54,601 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1230445049, now seen corresponding path program 1 times [2025-03-16 22:47:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121080860] [2025-03-16 22:47:54,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:54,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-16 22:47:54,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 22:47:54,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:54,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:56,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121080860] [2025-03-16 22:47:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121080860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:47:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:47:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:47:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067359450] [2025-03-16 22:47:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:47:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:47:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:47:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:47:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:47:56,613 INFO L87 Difference]: Start difference. First operand 651 states and 937 transitions. Second operand has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 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:47:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:47:57,142 INFO L93 Difference]: Finished difference Result 969 states and 1406 transitions. [2025-03-16 22:47:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:47:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 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 204 [2025-03-16 22:47:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:47:57,144 INFO L225 Difference]: With dead ends: 969 [2025-03-16 22:47:57,144 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 22:47:57,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:47:57,145 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 883 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:47:57,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 3526 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:47:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 22:47:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 655. [2025-03-16 22:47:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.4418960244648318) internal successors, (943), 654 states have internal predecessors, (943), 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:47:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 943 transitions. [2025-03-16 22:47:57,154 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 943 transitions. Word has length 204 [2025-03-16 22:47:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:47:57,154 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 943 transitions. [2025-03-16 22:47:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.545454545454547) internal successors, (204), 10 states have internal predecessors, (204), 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:47:57,154 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 943 transitions. [2025-03-16 22:47:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-16 22:47:57,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:47:57,156 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:47:57,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:47:57,156 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:47:57,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:47:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1570480977, now seen corresponding path program 1 times [2025-03-16 22:47:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:47:57,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274699415] [2025-03-16 22:47:57,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:57,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:47:57,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-16 22:47:57,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 22:47:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:47:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:47:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274699415] [2025-03-16 22:47:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274699415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:47:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665906803] [2025-03-16 22:47:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:47:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:47:58,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:47:58,674 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:47:58,676 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:47:59,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-16 22:47:59,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-16 22:47:59,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:47:59,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:47:59,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 174 conjuncts are in the unsatisfiable core [2025-03-16 22:47:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:01,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:48:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665906803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:48:06,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:48:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 27] total 66 [2025-03-16 22:48:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878597655] [2025-03-16 22:48:06,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:48:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-16 22:48:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-16 22:48:06,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=4045, Unknown=0, NotChecked=0, Total=4422 [2025-03-16 22:48:06,437 INFO L87 Difference]: Start difference. First operand 655 states and 943 transitions. Second operand has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 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:48:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:12,831 INFO L93 Difference]: Finished difference Result 1192 states and 1732 transitions. [2025-03-16 22:48:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-16 22:48:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 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 204 [2025-03-16 22:48:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:12,834 INFO L225 Difference]: With dead ends: 1192 [2025-03-16 22:48:12,834 INFO L226 Difference]: Without dead ends: 820 [2025-03-16 22:48:12,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5363 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1571, Invalid=16519, Unknown=0, NotChecked=0, Total=18090 [2025-03-16 22:48:12,838 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 4019 mSDsluCounter, 7066 mSDsCounter, 0 mSdLazyCounter, 9193 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4019 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 9232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 9193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:12,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4019 Valid, 7279 Invalid, 9232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 9193 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 22:48:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-16 22:48:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 692. [2025-03-16 22:48:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.4413892908827786) internal successors, (996), 691 states have internal predecessors, (996), 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:48:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 996 transitions. [2025-03-16 22:48:12,846 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 996 transitions. Word has length 204 [2025-03-16 22:48:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:12,847 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 996 transitions. [2025-03-16 22:48:12,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 9.0) internal successors, (603), 66 states have internal predecessors, (603), 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:48:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 996 transitions. [2025-03-16 22:48:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 22:48:12,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:12,848 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:48:12,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:48:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:13,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1009391587, now seen corresponding path program 1 times [2025-03-16 22:48:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520154445] [2025-03-16 22:48:13,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:13,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 22:48:13,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 22:48:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:14,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:14,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520154445] [2025-03-16 22:48:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520154445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:48:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:48:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:48:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321322097] [2025-03-16 22:48:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:48:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:48:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:14,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:48:14,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:48:14,286 INFO L87 Difference]: Start difference. First operand 692 states and 996 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 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:48:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:14,452 INFO L93 Difference]: Finished difference Result 1054 states and 1529 transitions. [2025-03-16 22:48:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:48:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 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 206 [2025-03-16 22:48:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:14,455 INFO L225 Difference]: With dead ends: 1054 [2025-03-16 22:48:14,455 INFO L226 Difference]: Without dead ends: 703 [2025-03-16 22:48:14,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:48:14,456 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 383 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:14,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1252 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:48:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-16 22:48:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 698. [2025-03-16 22:48:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4375896700143471) internal successors, (1002), 697 states have internal predecessors, (1002), 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:48:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1002 transitions. [2025-03-16 22:48:14,465 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1002 transitions. Word has length 206 [2025-03-16 22:48:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:14,465 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1002 transitions. [2025-03-16 22:48:14,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 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:48:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1002 transitions. [2025-03-16 22:48:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 22:48:14,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:14,466 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:48:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:48:14,466 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:14,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1040557526, now seen corresponding path program 1 times [2025-03-16 22:48:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123003446] [2025-03-16 22:48:14,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:14,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:14,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 22:48:14,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 22:48:14,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:14,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123003446] [2025-03-16 22:48:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123003446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:48:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927334487] [2025-03-16 22:48:16,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:16,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:16,858 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:48:16,859 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:48:17,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 22:48:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 22:48:17,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:17,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:17,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-16 22:48:17,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:18,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:48:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 22:48:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927334487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:48:19,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:48:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 42 [2025-03-16 22:48:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688496653] [2025-03-16 22:48:19,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:48:19,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 22:48:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:19,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 22:48:19,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 22:48:19,064 INFO L87 Difference]: Start difference. First operand 698 states and 1002 transitions. Second operand has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 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:48:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:22,167 INFO L93 Difference]: Finished difference Result 2624 states and 3817 transitions. [2025-03-16 22:48:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-16 22:48:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 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 207 [2025-03-16 22:48:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:22,172 INFO L225 Difference]: With dead ends: 2624 [2025-03-16 22:48:22,172 INFO L226 Difference]: Without dead ends: 2229 [2025-03-16 22:48:22,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5515 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2048, Invalid=14464, Unknown=0, NotChecked=0, Total=16512 [2025-03-16 22:48:22,176 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 9193 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9193 SdHoareTripleChecker+Valid, 8470 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:22,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9193 Valid, 8470 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:48:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2025-03-16 22:48:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 1443. [2025-03-16 22:48:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1442 states have (on average 1.4466019417475728) internal successors, (2086), 1442 states have internal predecessors, (2086), 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:48:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2086 transitions. [2025-03-16 22:48:22,195 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2086 transitions. Word has length 207 [2025-03-16 22:48:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2086 transitions. [2025-03-16 22:48:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 12.44186046511628) internal successors, (535), 42 states have internal predecessors, (535), 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:48:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2086 transitions. [2025-03-16 22:48:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 22:48:22,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:22,197 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:48:22,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 22:48:22,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:22,398 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:22,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1585505186, now seen corresponding path program 1 times [2025-03-16 22:48:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165811090] [2025-03-16 22:48:22,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 22:48:22,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 22:48:22,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165811090] [2025-03-16 22:48:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165811090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:48:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335395718] [2025-03-16 22:48:23,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:23,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:23,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:48:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 22:48:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 22:48:24,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 22:48:24,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:24,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:24,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 22:48:24,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:24,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:48:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335395718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:48:36,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:48:36,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 29 [2025-03-16 22:48:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349042553] [2025-03-16 22:48:36,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:48:36,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 22:48:36,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:36,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 22:48:36,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=4, NotChecked=0, Total=812 [2025-03-16 22:48:36,037 INFO L87 Difference]: Start difference. First operand 1443 states and 2086 transitions. Second operand has 29 states, 29 states have (on average 16.75862068965517) internal successors, (486), 29 states have internal predecessors, (486), 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:48:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:48:37,737 INFO L93 Difference]: Finished difference Result 3893 states and 5679 transitions. [2025-03-16 22:48:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 22:48:37,738 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 16.75862068965517) internal successors, (486), 29 states have internal predecessors, (486), 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 208 [2025-03-16 22:48:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:48:37,745 INFO L225 Difference]: With dead ends: 3893 [2025-03-16 22:48:37,745 INFO L226 Difference]: Without dead ends: 2935 [2025-03-16 22:48:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 395 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=682, Invalid=3870, Unknown=4, NotChecked=0, Total=4556 [2025-03-16 22:48:37,747 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 9914 mSDsluCounter, 6386 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9914 SdHoareTripleChecker+Valid, 6803 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:48:37,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9914 Valid, 6803 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 22:48:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2025-03-16 22:48:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2169. [2025-03-16 22:48:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4464944649446494) internal successors, (3136), 2168 states have internal predecessors, (3136), 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:48:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3136 transitions. [2025-03-16 22:48:37,774 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3136 transitions. Word has length 208 [2025-03-16 22:48:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:48:37,775 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3136 transitions. [2025-03-16 22:48:37,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.75862068965517) internal successors, (486), 29 states have internal predecessors, (486), 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:48:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3136 transitions. [2025-03-16 22:48:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 22:48:37,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:48:37,777 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:48:37,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 22:48:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 22:48:37,978 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:48:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:48:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -604221256, now seen corresponding path program 1 times [2025-03-16 22:48:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:48:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030472947] [2025-03-16 22:48:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:48:38,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 22:48:38,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 22:48:38,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:38,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:48:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030472947] [2025-03-16 22:48:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030472947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:48:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115040376] [2025-03-16 22:48:40,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:48:40,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:48:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:48:40,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:48:40,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 22:48:40,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 22:48:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 22:48:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:48:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:48:40,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-16 22:48:40,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:48:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:41,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:48:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:48:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115040376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:48:44,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:48:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 17] total 51 [2025-03-16 22:48:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104753687] [2025-03-16 22:48:44,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:48:44,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 22:48:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:48:44,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 22:48:44,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2443, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 22:48:44,964 INFO L87 Difference]: Start difference. First operand 2169 states and 3136 transitions. Second operand has 52 states, 52 states have (on average 11.826923076923077) internal successors, (615), 51 states have internal predecessors, (615), 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)