./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ff4eead42fe5c3232d9549669a622d0a23554d4f2d3afdf105ae081b78416ec8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:03:56,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:03:56,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:03:56,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:03:56,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:03:56,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:03:56,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:03:56,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:03:56,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:03:56,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:03:56,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:03:56,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:03:56,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:03:56,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:03:56,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:03:56,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:03:56,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:03:56,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:03:56,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:03:56,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:03:56,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:03:56,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:03:56,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:03:56,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:03:56,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:03:56,259 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-jdk21/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 -> ff4eead42fe5c3232d9549669a622d0a23554d4f2d3afdf105ae081b78416ec8 [2025-01-09 07:03:56,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:03:56,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:03:56,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:03:56,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:03:56,560 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:03:56,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c [2025-01-09 07:03:57,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d4c91fee/c8b6124047d444e88481b6d97e1ae9f1/FLAGbdb842820 [2025-01-09 07:03:58,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:03:58,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c [2025-01-09 07:03:58,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d4c91fee/c8b6124047d444e88481b6d97e1ae9f1/FLAGbdb842820 [2025-01-09 07:03:58,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d4c91fee/c8b6124047d444e88481b6d97e1ae9f1 [2025-01-09 07:03:58,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:03:58,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:03:58,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:03:58,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:03:58,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:03:58,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:03:58" (1/1) ... [2025-01-09 07:03:58,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7186b6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:58, skipping insertion in model container [2025-01-09 07:03:58,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:03:58" (1/1) ... [2025-01-09 07:03:58,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:03:58,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c[1335,1348] [2025-01-09 07:03:59,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:03:59,051 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:03:59,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c[1335,1348] [2025-01-09 07:03:59,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:03:59,255 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:03:59,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59 WrapperNode [2025-01-09 07:03:59,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:03:59,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:03:59,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:03:59,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:03:59,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:03:59,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:03:59,731 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5532 [2025-01-09 07:03:59,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:03:59,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:03:59,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:03:59,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:03:59,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:03:59,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:03:59,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,205 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-01-09 07:04:00,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:04:00,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:04:00,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:04:00,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:04:00,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (1/1) ... [2025-01-09 07:04:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:04:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:04:00,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:04:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:04:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:04:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 07:04:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 07:04:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:04:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:04:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:04:01,176 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:04:01,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:04:07,790 INFO L? ?]: Removed 3109 outVars from TransFormulas that were not future-live. [2025-01-09 07:04:07,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:04:07,833 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:04:07,833 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:04:07,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:04:07 BoogieIcfgContainer [2025-01-09 07:04:07,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:04:07,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:04:07,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:04:07,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:04:07,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:03:58" (1/3) ... [2025-01-09 07:04:07,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e23d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:04:07, skipping insertion in model container [2025-01-09 07:04:07,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:03:59" (2/3) ... [2025-01-09 07:04:07,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e23d7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:04:07, skipping insertion in model container [2025-01-09 07:04:07,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:04:07" (3/3) ... [2025-01-09 07:04:07,844 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c [2025-01-09 07:04:07,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:04:07,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w128_d64_e0.c that has 2 procedures, 1512 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:04:07,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:04:07,963 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;@49dd92fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:04:07,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:04:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 07:04:07,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:08,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:08,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:08,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1347883299, now seen corresponding path program 1 times [2025-01-09 07:04:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651706503] [2025-01-09 07:04:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:08,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 07:04:08,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 07:04:08,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:08,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 07:04:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651706503] [2025-01-09 07:04:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651706503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:04:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89217293] [2025-01-09 07:04:08,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:04:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:04:08,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:04:08,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:04:09,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 07:04:10,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 07:04:10,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:10,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:10,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 2377 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 07:04:10,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:04:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 07:04:10,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:04:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89217293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:04:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 07:04:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327992267] [2025-01-09 07:04:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 07:04:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:10,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 07:04:10,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:04:10,234 INFO L87 Difference]: Start difference. First operand has 1512 states, 1506 states have (on average 1.49800796812749) internal successors, (2256), 1507 states have internal predecessors, (2256), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 07:04:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:10,337 INFO L93 Difference]: Finished difference Result 2727 states and 4085 transitions. [2025-01-09 07:04:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 07:04:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 341 [2025-01-09 07:04:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:10,366 INFO L225 Difference]: With dead ends: 2727 [2025-01-09 07:04:10,367 INFO L226 Difference]: Without dead ends: 1509 [2025-01-09 07:04:10,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:04:10,378 INFO L435 NwaCegarLoop]: 2257 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:10,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:04:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-01-09 07:04:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-01-09 07:04:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1504 states have (on average 1.4966755319148937) internal successors, (2251), 1504 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2257 transitions. [2025-01-09 07:04:10,481 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2257 transitions. Word has length 341 [2025-01-09 07:04:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:10,484 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2257 transitions. [2025-01-09 07:04:10,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 07:04:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2257 transitions. [2025-01-09 07:04:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-01-09 07:04:10,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:10,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:10,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:04:10,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 07:04:10,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:10,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -826681251, now seen corresponding path program 1 times [2025-01-09 07:04:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420294160] [2025-01-09 07:04:10,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:10,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-09 07:04:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-09 07:04:11,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:11,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420294160] [2025-01-09 07:04:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420294160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:04:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874304882] [2025-01-09 07:04:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:04:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:04:12,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:04:12,873 INFO L87 Difference]: Start difference. First operand 1509 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:12,951 INFO L93 Difference]: Finished difference Result 1513 states and 2261 transitions. [2025-01-09 07:04:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 341 [2025-01-09 07:04:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:12,963 INFO L225 Difference]: With dead ends: 1513 [2025-01-09 07:04:12,963 INFO L226 Difference]: Without dead ends: 1511 [2025-01-09 07:04:12,964 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-01-09 07:04:12,965 INFO L435 NwaCegarLoop]: 2255 mSDtfsCounter, 0 mSDsluCounter, 4504 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6759 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:12,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6759 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:04:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-09 07:04:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2025-01-09 07:04:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1506 states have (on average 1.49601593625498) internal successors, (2253), 1506 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2259 transitions. [2025-01-09 07:04:12,999 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2259 transitions. Word has length 341 [2025-01-09 07:04:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2259 transitions. [2025-01-09 07:04:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2259 transitions. [2025-01-09 07:04:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 07:04:13,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:13,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:13,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:04:13,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 144382221, now seen corresponding path program 1 times [2025-01-09 07:04:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774323614] [2025-01-09 07:04:13,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:13,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 07:04:13,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 07:04:13,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:13,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774323614] [2025-01-09 07:04:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774323614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700236943] [2025-01-09 07:04:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:14,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:14,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:14,329 INFO L87 Difference]: Start difference. First operand 1511 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:15,250 INFO L93 Difference]: Finished difference Result 3771 states and 5641 transitions. [2025-01-09 07:04:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:04:15,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 342 [2025-01-09 07:04:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:15,258 INFO L225 Difference]: With dead ends: 3771 [2025-01-09 07:04:15,258 INFO L226 Difference]: Without dead ends: 1511 [2025-01-09 07:04:15,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:04:15,262 INFO L435 NwaCegarLoop]: 2253 mSDtfsCounter, 4786 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 6335 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:15,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 6335 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 07:04:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-09 07:04:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2025-01-09 07:04:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1506 states have (on average 1.49535192563081) internal successors, (2252), 1506 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2258 transitions. [2025-01-09 07:04:15,299 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2258 transitions. Word has length 342 [2025-01-09 07:04:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:15,299 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2258 transitions. [2025-01-09 07:04:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2258 transitions. [2025-01-09 07:04:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 07:04:15,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:15,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:15,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:04:15,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:15,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1812366321, now seen corresponding path program 1 times [2025-01-09 07:04:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262223697] [2025-01-09 07:04:15,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:15,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 07:04:15,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 07:04:15,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:15,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:16,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:16,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262223697] [2025-01-09 07:04:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262223697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:16,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:16,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:04:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42900900] [2025-01-09 07:04:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:04:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:04:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:04:16,259 INFO L87 Difference]: Start difference. First operand 1511 states and 2258 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:16,344 INFO L93 Difference]: Finished difference Result 2730 states and 4079 transitions. [2025-01-09 07:04:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:16,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 343 [2025-01-09 07:04:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:16,354 INFO L225 Difference]: With dead ends: 2730 [2025-01-09 07:04:16,354 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:16,356 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-01-09 07:04:16,357 INFO L435 NwaCegarLoop]: 2254 mSDtfsCounter, 0 mSDsluCounter, 4498 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6752 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:16,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6752 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:04:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4946949602122015) internal successors, (2254), 1508 states have internal predecessors, (2254), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2260 transitions. [2025-01-09 07:04:16,397 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2260 transitions. Word has length 343 [2025-01-09 07:04:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2260 transitions. [2025-01-09 07:04:16,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2260 transitions. [2025-01-09 07:04:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-09 07:04:16,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:16,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:04:16,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:16,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1446744972, now seen corresponding path program 1 times [2025-01-09 07:04:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043078826] [2025-01-09 07:04:16,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:16,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-09 07:04:16,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-09 07:04:16,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:16,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:17,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043078826] [2025-01-09 07:04:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043078826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:17,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:04:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027051832] [2025-01-09 07:04:17,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:17,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:04:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:04:17,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:04:17,630 INFO L87 Difference]: Start difference. First operand 1513 states and 2260 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:18,252 INFO L93 Difference]: Finished difference Result 2732 states and 4080 transitions. [2025-01-09 07:04:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 344 [2025-01-09 07:04:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:18,261 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:18,262 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:18,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:18,265 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 1946 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:18,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 3870 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:04:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4940318302387268) internal successors, (2253), 1508 states have internal predecessors, (2253), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2259 transitions. [2025-01-09 07:04:18,304 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2259 transitions. Word has length 344 [2025-01-09 07:04:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:18,305 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2259 transitions. [2025-01-09 07:04:18,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2259 transitions. [2025-01-09 07:04:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-09 07:04:18,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:18,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:18,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:04:18,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:18,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash -120667538, now seen corresponding path program 1 times [2025-01-09 07:04:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796345342] [2025-01-09 07:04:18,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-09 07:04:18,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-09 07:04:18,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:18,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796345342] [2025-01-09 07:04:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796345342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156535432] [2025-01-09 07:04:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:19,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:19,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:19,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:19,142 INFO L87 Difference]: Start difference. First operand 1513 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:19,642 INFO L93 Difference]: Finished difference Result 2782 states and 4152 transitions. [2025-01-09 07:04:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:04:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 345 [2025-01-09 07:04:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:19,649 INFO L225 Difference]: With dead ends: 2782 [2025-01-09 07:04:19,650 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:19,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 07:04:19,654 INFO L435 NwaCegarLoop]: 2224 mSDtfsCounter, 2045 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 6386 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:19,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 6386 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:04:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.493368700265252) internal successors, (2252), 1508 states have internal predecessors, (2252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2258 transitions. [2025-01-09 07:04:19,692 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2258 transitions. Word has length 345 [2025-01-09 07:04:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:19,693 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2258 transitions. [2025-01-09 07:04:19,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2258 transitions. [2025-01-09 07:04:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 07:04:19,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:19,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:19,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:04:19,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:19,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1732244261, now seen corresponding path program 1 times [2025-01-09 07:04:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108035549] [2025-01-09 07:04:19,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:19,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 07:04:19,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 07:04:19,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:19,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108035549] [2025-01-09 07:04:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108035549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:20,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459587189] [2025-01-09 07:04:20,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:20,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:20,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:20,449 INFO L87 Difference]: Start difference. First operand 1513 states and 2258 transitions. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:21,055 INFO L93 Difference]: Finished difference Result 2732 states and 4076 transitions. [2025-01-09 07:04:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:21,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 346 [2025-01-09 07:04:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:21,064 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:21,064 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:21,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:21,068 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2242 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:21,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 3877 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.492705570291777) internal successors, (2251), 1508 states have internal predecessors, (2251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2257 transitions. [2025-01-09 07:04:21,106 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2257 transitions. Word has length 346 [2025-01-09 07:04:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:21,106 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2257 transitions. [2025-01-09 07:04:21,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2257 transitions. [2025-01-09 07:04:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-01-09 07:04:21,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:21,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:21,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:04:21,111 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -438999243, now seen corresponding path program 1 times [2025-01-09 07:04:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733239899] [2025-01-09 07:04:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:21,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-01-09 07:04:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-01-09 07:04:21,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:21,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733239899] [2025-01-09 07:04:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733239899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26299830] [2025-01-09 07:04:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:21,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:21,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:21,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:21,943 INFO L87 Difference]: Start difference. First operand 1513 states and 2257 transitions. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:22,546 INFO L93 Difference]: Finished difference Result 2732 states and 4074 transitions. [2025-01-09 07:04:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 347 [2025-01-09 07:04:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:22,554 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:22,554 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:22,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:22,557 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2238 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:22,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 3877 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4920424403183024) internal successors, (2250), 1508 states have internal predecessors, (2250), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2256 transitions. [2025-01-09 07:04:22,593 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2256 transitions. Word has length 347 [2025-01-09 07:04:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:22,594 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2256 transitions. [2025-01-09 07:04:22,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2256 transitions. [2025-01-09 07:04:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 07:04:22,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:22,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:04:22,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 530010316, now seen corresponding path program 1 times [2025-01-09 07:04:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304034534] [2025-01-09 07:04:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:22,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:22,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 07:04:22,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 07:04:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304034534] [2025-01-09 07:04:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304034534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266474265] [2025-01-09 07:04:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:23,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:23,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:23,350 INFO L87 Difference]: Start difference. First operand 1513 states and 2256 transitions. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:24,002 INFO L93 Difference]: Finished difference Result 2732 states and 4072 transitions. [2025-01-09 07:04:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 348 [2025-01-09 07:04:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:24,010 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:24,010 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:24,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:24,013 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2234 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2237 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:24,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2237 Valid, 3877 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:04:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4913793103448276) internal successors, (2249), 1508 states have internal predecessors, (2249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2255 transitions. [2025-01-09 07:04:24,047 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2255 transitions. Word has length 348 [2025-01-09 07:04:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:24,048 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2255 transitions. [2025-01-09 07:04:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2255 transitions. [2025-01-09 07:04:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 07:04:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:24,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:24,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 07:04:24,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:24,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -943967364, now seen corresponding path program 1 times [2025-01-09 07:04:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883461923] [2025-01-09 07:04:24,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 07:04:24,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 07:04:24,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:24,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:24,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883461923] [2025-01-09 07:04:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883461923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807422480] [2025-01-09 07:04:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:24,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:24,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:24,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:24,753 INFO L87 Difference]: Start difference. First operand 1513 states and 2255 transitions. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:25,331 INFO L93 Difference]: Finished difference Result 2732 states and 4070 transitions. [2025-01-09 07:04:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 349 [2025-01-09 07:04:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:25,339 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:25,339 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:25,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:25,342 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4207 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:25,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 3870 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.490716180371353) internal successors, (2248), 1508 states have internal predecessors, (2248), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2254 transitions. [2025-01-09 07:04:25,376 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2254 transitions. Word has length 349 [2025-01-09 07:04:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:25,377 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2254 transitions. [2025-01-09 07:04:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2254 transitions. [2025-01-09 07:04:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 07:04:25,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:25,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:25,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:04:25,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:25,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1651666419, now seen corresponding path program 1 times [2025-01-09 07:04:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812479857] [2025-01-09 07:04:25,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 07:04:25,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 07:04:25,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:25,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:26,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812479857] [2025-01-09 07:04:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812479857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:26,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:26,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592860891] [2025-01-09 07:04:26,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:26,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:26,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:26,091 INFO L87 Difference]: Start difference. First operand 1513 states and 2254 transitions. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:26,650 INFO L93 Difference]: Finished difference Result 2732 states and 4068 transitions. [2025-01-09 07:04:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 350 [2025-01-09 07:04:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:26,658 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:26,658 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:26,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:26,661 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2226 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:26,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 3877 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.490053050397878) internal successors, (2247), 1508 states have internal predecessors, (2247), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2253 transitions. [2025-01-09 07:04:26,700 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2253 transitions. Word has length 350 [2025-01-09 07:04:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2253 transitions. [2025-01-09 07:04:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2253 transitions. [2025-01-09 07:04:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 07:04:26,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:26,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:26,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:04:26,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:26,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1136138429, now seen corresponding path program 1 times [2025-01-09 07:04:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:26,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836695880] [2025-01-09 07:04:26,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:26,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 07:04:26,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 07:04:26,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:26,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836695880] [2025-01-09 07:04:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836695880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:27,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432658917] [2025-01-09 07:04:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:27,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:27,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:27,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:27,329 INFO L87 Difference]: Start difference. First operand 1513 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:27,874 INFO L93 Difference]: Finished difference Result 2732 states and 4066 transitions. [2025-01-09 07:04:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 351 [2025-01-09 07:04:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:27,886 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:27,886 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:27,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:27,889 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4191 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:27,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4194 Valid, 3870 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4893899204244032) internal successors, (2246), 1508 states have internal predecessors, (2246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2252 transitions. [2025-01-09 07:04:27,926 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2252 transitions. Word has length 351 [2025-01-09 07:04:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:27,926 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2252 transitions. [2025-01-09 07:04:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2252 transitions. [2025-01-09 07:04:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 07:04:27,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:27,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:04:27,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1186466458, now seen corresponding path program 1 times [2025-01-09 07:04:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626284237] [2025-01-09 07:04:27,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 07:04:28,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 07:04:28,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:28,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626284237] [2025-01-09 07:04:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626284237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980647118] [2025-01-09 07:04:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:28,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:28,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:28,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:28,615 INFO L87 Difference]: Start difference. First operand 1513 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:29,157 INFO L93 Difference]: Finished difference Result 2732 states and 4064 transitions. [2025-01-09 07:04:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 352 [2025-01-09 07:04:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:29,163 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:29,163 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:29,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:29,166 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2218 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:29,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2221 Valid, 3877 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4887267904509285) internal successors, (2245), 1508 states have internal predecessors, (2245), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2251 transitions. [2025-01-09 07:04:29,195 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2251 transitions. Word has length 352 [2025-01-09 07:04:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2251 transitions. [2025-01-09 07:04:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2251 transitions. [2025-01-09 07:04:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 07:04:29,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:29,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:29,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 07:04:29,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash -195214710, now seen corresponding path program 1 times [2025-01-09 07:04:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985824658] [2025-01-09 07:04:29,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:29,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 07:04:29,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 07:04:29,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:29,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985824658] [2025-01-09 07:04:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985824658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:29,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220092945] [2025-01-09 07:04:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:29,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:29,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:29,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:29,852 INFO L87 Difference]: Start difference. First operand 1513 states and 2251 transitions. Second operand has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:30,390 INFO L93 Difference]: Finished difference Result 2732 states and 4062 transitions. [2025-01-09 07:04:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 353 [2025-01-09 07:04:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:30,397 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:30,397 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:30,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:30,400 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4175 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:30,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 3870 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4880636604774535) internal successors, (2244), 1508 states have internal predecessors, (2244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2250 transitions. [2025-01-09 07:04:30,427 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2250 transitions. Word has length 353 [2025-01-09 07:04:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:30,428 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2250 transitions. [2025-01-09 07:04:30,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2250 transitions. [2025-01-09 07:04:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 07:04:30,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:30,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 07:04:30,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:30,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1240393409, now seen corresponding path program 1 times [2025-01-09 07:04:30,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947886488] [2025-01-09 07:04:30,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:30,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 07:04:30,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 07:04:30,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:30,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:31,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947886488] [2025-01-09 07:04:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947886488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722410035] [2025-01-09 07:04:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:31,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:31,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:31,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:31,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:31,077 INFO L87 Difference]: Start difference. First operand 1513 states and 2250 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:31,624 INFO L93 Difference]: Finished difference Result 2732 states and 4060 transitions. [2025-01-09 07:04:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 354 [2025-01-09 07:04:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:31,631 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:31,631 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:31,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:31,633 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2210 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:31,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 3877 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4874005305039788) internal successors, (2243), 1508 states have internal predecessors, (2243), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2249 transitions. [2025-01-09 07:04:31,657 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2249 transitions. Word has length 354 [2025-01-09 07:04:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:31,657 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2249 transitions. [2025-01-09 07:04:31,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2249 transitions. [2025-01-09 07:04:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 07:04:31,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:31,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:31,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 07:04:31,661 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1811872431, now seen corresponding path program 1 times [2025-01-09 07:04:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:31,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083250690] [2025-01-09 07:04:31,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:31,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 07:04:31,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 07:04:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083250690] [2025-01-09 07:04:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083250690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173325685] [2025-01-09 07:04:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:32,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:32,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:32,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:32,424 INFO L87 Difference]: Start difference. First operand 1513 states and 2249 transitions. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:32,979 INFO L93 Difference]: Finished difference Result 2732 states and 4058 transitions. [2025-01-09 07:04:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 355 [2025-01-09 07:04:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:32,984 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:32,984 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:32,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:32,986 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4159 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:32,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 3870 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 07:04:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.486737400530504) internal successors, (2242), 1508 states have internal predecessors, (2242), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2248 transitions. [2025-01-09 07:04:33,008 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2248 transitions. Word has length 355 [2025-01-09 07:04:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:33,009 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2248 transitions. [2025-01-09 07:04:33,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2248 transitions. [2025-01-09 07:04:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-09 07:04:33,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:33,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 07:04:33,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:33,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1346224744, now seen corresponding path program 1 times [2025-01-09 07:04:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:33,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075745504] [2025-01-09 07:04:33,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:33,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 07:04:33,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 07:04:33,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:33,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075745504] [2025-01-09 07:04:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075745504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:33,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:33,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:33,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124626798] [2025-01-09 07:04:33,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:33,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:33,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:33,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:33,552 INFO L87 Difference]: Start difference. First operand 1513 states and 2248 transitions. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:33,983 INFO L93 Difference]: Finished difference Result 2732 states and 4056 transitions. [2025-01-09 07:04:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 356 [2025-01-09 07:04:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:33,993 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:33,993 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:33,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:33,999 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4151 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:33,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 3870 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:04:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4860742705570291) internal successors, (2241), 1508 states have internal predecessors, (2241), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2247 transitions. [2025-01-09 07:04:34,026 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2247 transitions. Word has length 356 [2025-01-09 07:04:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2247 transitions. [2025-01-09 07:04:34,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2247 transitions. [2025-01-09 07:04:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 07:04:34,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:34,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:34,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 07:04:34,030 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:34,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1839730792, now seen corresponding path program 1 times [2025-01-09 07:04:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971235384] [2025-01-09 07:04:34,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:34,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 07:04:34,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 07:04:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:34,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971235384] [2025-01-09 07:04:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971235384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:34,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767353484] [2025-01-09 07:04:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:34,643 INFO L87 Difference]: Start difference. First operand 1513 states and 2247 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:35,089 INFO L93 Difference]: Finished difference Result 2732 states and 4054 transitions. [2025-01-09 07:04:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:35,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 357 [2025-01-09 07:04:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:35,098 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:35,098 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:35,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:35,100 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4143 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:35,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 3870 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:04:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4854111405835544) internal successors, (2240), 1508 states have internal predecessors, (2240), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2246 transitions. [2025-01-09 07:04:35,121 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2246 transitions. Word has length 357 [2025-01-09 07:04:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:35,121 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2246 transitions. [2025-01-09 07:04:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2246 transitions. [2025-01-09 07:04:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 07:04:35,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:35,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 07:04:35,124 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:35,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1536467569, now seen corresponding path program 1 times [2025-01-09 07:04:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:35,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191981520] [2025-01-09 07:04:35,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:35,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:35,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 07:04:35,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 07:04:35,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:35,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191981520] [2025-01-09 07:04:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191981520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225290214] [2025-01-09 07:04:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:35,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:35,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:35,646 INFO L87 Difference]: Start difference. First operand 1513 states and 2246 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:36,019 INFO L93 Difference]: Finished difference Result 2732 states and 4052 transitions. [2025-01-09 07:04:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:36,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 358 [2025-01-09 07:04:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:36,024 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:36,024 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:36,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:36,026 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4135 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:36,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 3870 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4847480106100797) internal successors, (2239), 1508 states have internal predecessors, (2239), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2245 transitions. [2025-01-09 07:04:36,045 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2245 transitions. Word has length 358 [2025-01-09 07:04:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2245 transitions. [2025-01-09 07:04:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2245 transitions. [2025-01-09 07:04:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 07:04:36,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:36,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 07:04:36,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1717124769, now seen corresponding path program 1 times [2025-01-09 07:04:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540980847] [2025-01-09 07:04:36,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:36,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 07:04:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 07:04:36,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:36,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540980847] [2025-01-09 07:04:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540980847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:36,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776720642] [2025-01-09 07:04:36,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:36,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:36,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:36,614 INFO L87 Difference]: Start difference. First operand 1513 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:36,989 INFO L93 Difference]: Finished difference Result 2732 states and 4050 transitions. [2025-01-09 07:04:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 359 [2025-01-09 07:04:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:36,994 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:36,994 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:36,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:36,996 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2190 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:36,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 3877 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4840848806366047) internal successors, (2238), 1508 states have internal predecessors, (2238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2244 transitions. [2025-01-09 07:04:37,015 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2244 transitions. Word has length 359 [2025-01-09 07:04:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:37,016 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2244 transitions. [2025-01-09 07:04:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2244 transitions. [2025-01-09 07:04:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-09 07:04:37,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:37,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:37,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 07:04:37,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:37,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash -136415178, now seen corresponding path program 1 times [2025-01-09 07:04:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834412433] [2025-01-09 07:04:37,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:37,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 07:04:37,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 07:04:37,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:37,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834412433] [2025-01-09 07:04:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834412433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:37,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:37,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053317316] [2025-01-09 07:04:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:37,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:37,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:37,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:37,524 INFO L87 Difference]: Start difference. First operand 1513 states and 2244 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:37,916 INFO L93 Difference]: Finished difference Result 2732 states and 4048 transitions. [2025-01-09 07:04:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 360 [2025-01-09 07:04:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:37,921 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:37,921 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:37,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:37,924 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4119 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:37,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 3870 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:04:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.48342175066313) internal successors, (2237), 1508 states have internal predecessors, (2237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2243 transitions. [2025-01-09 07:04:37,951 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2243 transitions. Word has length 360 [2025-01-09 07:04:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:37,952 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2243 transitions. [2025-01-09 07:04:37,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2243 transitions. [2025-01-09 07:04:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-09 07:04:37,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:37,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:37,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 07:04:37,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:37,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash -414041434, now seen corresponding path program 1 times [2025-01-09 07:04:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:37,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474469596] [2025-01-09 07:04:37,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:38,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-01-09 07:04:38,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-01-09 07:04:38,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:38,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:38,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:38,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474469596] [2025-01-09 07:04:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474469596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093576092] [2025-01-09 07:04:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:38,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:38,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:38,586 INFO L87 Difference]: Start difference. First operand 1513 states and 2243 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:38,956 INFO L93 Difference]: Finished difference Result 2732 states and 4046 transitions. [2025-01-09 07:04:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 361 [2025-01-09 07:04:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:38,959 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:38,959 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:38,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:38,962 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4111 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:38,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 3870 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4827586206896552) internal successors, (2236), 1508 states have internal predecessors, (2236), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2242 transitions. [2025-01-09 07:04:38,976 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2242 transitions. Word has length 361 [2025-01-09 07:04:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:38,976 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2242 transitions. [2025-01-09 07:04:38,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2242 transitions. [2025-01-09 07:04:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 07:04:38,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:38,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:38,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 07:04:38,979 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1654510173, now seen corresponding path program 1 times [2025-01-09 07:04:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:38,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735882559] [2025-01-09 07:04:38,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:38,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 07:04:39,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 07:04:39,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:39,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735882559] [2025-01-09 07:04:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735882559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506407731] [2025-01-09 07:04:39,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:39,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:39,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:39,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:39,531 INFO L87 Difference]: Start difference. First operand 1513 states and 2242 transitions. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:39,898 INFO L93 Difference]: Finished difference Result 2732 states and 4044 transitions. [2025-01-09 07:04:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:39,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 362 [2025-01-09 07:04:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:39,901 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:39,901 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:39,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:39,902 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4103 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:39,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 3870 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4820954907161803) internal successors, (2235), 1508 states have internal predecessors, (2235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2241 transitions. [2025-01-09 07:04:39,914 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2241 transitions. Word has length 362 [2025-01-09 07:04:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:39,914 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2241 transitions. [2025-01-09 07:04:39,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2241 transitions. [2025-01-09 07:04:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 07:04:39,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:39,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:39,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 07:04:39,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:39,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash 736041837, now seen corresponding path program 1 times [2025-01-09 07:04:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848770965] [2025-01-09 07:04:39,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 07:04:40,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 07:04:40,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:40,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848770965] [2025-01-09 07:04:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848770965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:40,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:40,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420926982] [2025-01-09 07:04:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:40,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:40,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:40,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:40,683 INFO L87 Difference]: Start difference. First operand 1513 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:41,047 INFO L93 Difference]: Finished difference Result 2732 states and 4042 transitions. [2025-01-09 07:04:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 363 [2025-01-09 07:04:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:41,051 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:41,051 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:41,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:41,054 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2174 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:41,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 3877 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4814323607427056) internal successors, (2234), 1508 states have internal predecessors, (2234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2240 transitions. [2025-01-09 07:04:41,071 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2240 transitions. Word has length 363 [2025-01-09 07:04:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:41,072 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2240 transitions. [2025-01-09 07:04:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.2) internal successors, (351), 5 states have internal predecessors, (351), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2240 transitions. [2025-01-09 07:04:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-01-09 07:04:41,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:41,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 07:04:41,074 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1666198532, now seen corresponding path program 1 times [2025-01-09 07:04:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837652116] [2025-01-09 07:04:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-01-09 07:04:41,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-01-09 07:04:41,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:41,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837652116] [2025-01-09 07:04:41,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837652116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:41,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888438454] [2025-01-09 07:04:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:41,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:41,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:41,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:41,563 INFO L87 Difference]: Start difference. First operand 1513 states and 2240 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:41,952 INFO L93 Difference]: Finished difference Result 2732 states and 4040 transitions. [2025-01-09 07:04:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 364 [2025-01-09 07:04:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:41,956 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:41,957 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:41,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:41,959 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4087 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 3870 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:04:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4807692307692308) internal successors, (2233), 1508 states have internal predecessors, (2233), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2239 transitions. [2025-01-09 07:04:41,975 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2239 transitions. Word has length 364 [2025-01-09 07:04:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:41,975 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2239 transitions. [2025-01-09 07:04:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2239 transitions. [2025-01-09 07:04:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 07:04:41,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:41,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 07:04:41,978 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1794253748, now seen corresponding path program 1 times [2025-01-09 07:04:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930674894] [2025-01-09 07:04:41,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 07:04:42,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 07:04:42,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:42,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:42,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:42,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930674894] [2025-01-09 07:04:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930674894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:42,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274998877] [2025-01-09 07:04:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:42,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:42,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:42,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:42,628 INFO L87 Difference]: Start difference. First operand 1513 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:43,012 INFO L93 Difference]: Finished difference Result 2732 states and 4038 transitions. [2025-01-09 07:04:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 365 [2025-01-09 07:04:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:43,015 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:43,016 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:43,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:43,017 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4079 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:43,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4082 Valid, 3870 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4801061007957559) internal successors, (2232), 1508 states have internal predecessors, (2232), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2238 transitions. [2025-01-09 07:04:43,030 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2238 transitions. Word has length 365 [2025-01-09 07:04:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:43,030 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2238 transitions. [2025-01-09 07:04:43,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2238 transitions. [2025-01-09 07:04:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 07:04:43,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:43,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 07:04:43,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -549698261, now seen corresponding path program 1 times [2025-01-09 07:04:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500952166] [2025-01-09 07:04:43,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 07:04:43,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 07:04:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500952166] [2025-01-09 07:04:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500952166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716842978] [2025-01-09 07:04:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:43,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:43,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:43,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:43,514 INFO L87 Difference]: Start difference. First operand 1513 states and 2238 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:43,875 INFO L93 Difference]: Finished difference Result 2732 states and 4036 transitions. [2025-01-09 07:04:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 366 [2025-01-09 07:04:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:43,878 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:43,878 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:43,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:43,879 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4071 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:43,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 3870 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4794429708222812) internal successors, (2231), 1508 states have internal predecessors, (2231), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2237 transitions. [2025-01-09 07:04:43,892 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2237 transitions. Word has length 366 [2025-01-09 07:04:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:43,892 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2237 transitions. [2025-01-09 07:04:43,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2237 transitions. [2025-01-09 07:04:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 07:04:43,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:43,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:43,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 07:04:43,894 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -615509125, now seen corresponding path program 1 times [2025-01-09 07:04:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249466445] [2025-01-09 07:04:43,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 07:04:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 07:04:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249466445] [2025-01-09 07:04:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249466445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558528289] [2025-01-09 07:04:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:44,513 INFO L87 Difference]: Start difference. First operand 1513 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:44,870 INFO L93 Difference]: Finished difference Result 2732 states and 4034 transitions. [2025-01-09 07:04:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 367 [2025-01-09 07:04:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:44,874 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:44,874 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:44,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:44,876 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2158 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:44,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 3877 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4787798408488064) internal successors, (2230), 1508 states have internal predecessors, (2230), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2236 transitions. [2025-01-09 07:04:44,894 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2236 transitions. Word has length 367 [2025-01-09 07:04:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:44,895 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2236 transitions. [2025-01-09 07:04:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2236 transitions. [2025-01-09 07:04:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 07:04:44,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:44,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:44,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 07:04:44,897 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 575200722, now seen corresponding path program 1 times [2025-01-09 07:04:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:44,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137359173] [2025-01-09 07:04:44,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:44,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 07:04:45,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 07:04:45,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:45,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137359173] [2025-01-09 07:04:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137359173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479532969] [2025-01-09 07:04:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:45,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:45,468 INFO L87 Difference]: Start difference. First operand 1513 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:45,831 INFO L93 Difference]: Finished difference Result 2732 states and 4032 transitions. [2025-01-09 07:04:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:45,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 368 [2025-01-09 07:04:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:45,834 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:45,834 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:45,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:45,836 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4055 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:45,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4058 Valid, 3870 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4781167108753315) internal successors, (2229), 1508 states have internal predecessors, (2229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2235 transitions. [2025-01-09 07:04:45,850 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2235 transitions. Word has length 368 [2025-01-09 07:04:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2235 transitions. [2025-01-09 07:04:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2235 transitions. [2025-01-09 07:04:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 07:04:45,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:45,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:45,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 07:04:45,852 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:45,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -958551358, now seen corresponding path program 1 times [2025-01-09 07:04:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:45,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752383199] [2025-01-09 07:04:45,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:45,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 07:04:46,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 07:04:46,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:46,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752383199] [2025-01-09 07:04:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752383199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800334696] [2025-01-09 07:04:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:46,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:46,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:46,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:46,487 INFO L87 Difference]: Start difference. First operand 1513 states and 2235 transitions. Second operand has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:46,853 INFO L93 Difference]: Finished difference Result 2732 states and 4030 transitions. [2025-01-09 07:04:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 369 [2025-01-09 07:04:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:46,856 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:46,857 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:46,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:46,860 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4047 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4050 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:46,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4050 Valid, 3870 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4774535809018567) internal successors, (2228), 1508 states have internal predecessors, (2228), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2234 transitions. [2025-01-09 07:04:46,878 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2234 transitions. Word has length 369 [2025-01-09 07:04:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:46,879 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2234 transitions. [2025-01-09 07:04:46,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.4) internal successors, (357), 5 states have internal predecessors, (357), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2234 transitions. [2025-01-09 07:04:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 07:04:46,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:46,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 07:04:46,882 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:46,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash -553863687, now seen corresponding path program 1 times [2025-01-09 07:04:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885576186] [2025-01-09 07:04:46,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:46,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 07:04:47,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 07:04:47,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:47,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:47,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885576186] [2025-01-09 07:04:47,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885576186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:47,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:47,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461723350] [2025-01-09 07:04:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:47,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:47,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:47,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:47,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:47,417 INFO L87 Difference]: Start difference. First operand 1513 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:47,782 INFO L93 Difference]: Finished difference Result 2732 states and 4028 transitions. [2025-01-09 07:04:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:47,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 370 [2025-01-09 07:04:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:47,785 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:47,786 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:47,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:47,788 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4033 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:47,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 3870 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.476790450928382) internal successors, (2227), 1508 states have internal predecessors, (2227), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2233 transitions. [2025-01-09 07:04:47,807 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2233 transitions. Word has length 370 [2025-01-09 07:04:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:47,807 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2233 transitions. [2025-01-09 07:04:47,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2233 transitions. [2025-01-09 07:04:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-09 07:04:47,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:47,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:47,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 07:04:47,810 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2110426366, now seen corresponding path program 1 times [2025-01-09 07:04:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865034007] [2025-01-09 07:04:47,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 07:04:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 07:04:48,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865034007] [2025-01-09 07:04:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865034007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365634420] [2025-01-09 07:04:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:48,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:48,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:48,364 INFO L87 Difference]: Start difference. First operand 1513 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:48,733 INFO L93 Difference]: Finished difference Result 2732 states and 4026 transitions. [2025-01-09 07:04:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 371 [2025-01-09 07:04:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:48,736 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:48,736 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:48,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:48,740 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2139 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:48,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 3877 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.476127320954907) internal successors, (2226), 1508 states have internal predecessors, (2226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2232 transitions. [2025-01-09 07:04:48,763 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2232 transitions. Word has length 371 [2025-01-09 07:04:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:48,763 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2232 transitions. [2025-01-09 07:04:48,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2232 transitions. [2025-01-09 07:04:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 07:04:48,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:48,766 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 07:04:48,766 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1028664018, now seen corresponding path program 1 times [2025-01-09 07:04:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233803348] [2025-01-09 07:04:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:48,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 07:04:48,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 07:04:48,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:48,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233803348] [2025-01-09 07:04:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233803348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299734438] [2025-01-09 07:04:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:49,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:49,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:49,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:49,336 INFO L87 Difference]: Start difference. First operand 1513 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:49,705 INFO L93 Difference]: Finished difference Result 2732 states and 4024 transitions. [2025-01-09 07:04:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 372 [2025-01-09 07:04:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:49,709 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:49,709 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:49,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:49,711 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 2135 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:49,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 3877 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4754641909814323) internal successors, (2225), 1508 states have internal predecessors, (2225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2231 transitions. [2025-01-09 07:04:49,730 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2231 transitions. Word has length 372 [2025-01-09 07:04:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2231 transitions. [2025-01-09 07:04:49,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2231 transitions. [2025-01-09 07:04:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-09 07:04:49,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:49,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:49,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 07:04:49,734 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:49,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1226056965, now seen corresponding path program 1 times [2025-01-09 07:04:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:49,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585512583] [2025-01-09 07:04:49,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:49,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-09 07:04:49,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-09 07:04:49,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585512583] [2025-01-09 07:04:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585512583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521750655] [2025-01-09 07:04:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:50,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:50,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:50,312 INFO L87 Difference]: Start difference. First operand 1513 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:50,672 INFO L93 Difference]: Finished difference Result 2732 states and 4022 transitions. [2025-01-09 07:04:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 373 [2025-01-09 07:04:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:50,675 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:50,675 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:50,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:50,677 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4009 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4012 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:50,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4012 Valid, 3870 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4748010610079576) internal successors, (2224), 1508 states have internal predecessors, (2224), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2230 transitions. [2025-01-09 07:04:50,693 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2230 transitions. Word has length 373 [2025-01-09 07:04:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:50,694 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2230 transitions. [2025-01-09 07:04:50,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2230 transitions. [2025-01-09 07:04:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 07:04:50,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:50,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:50,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 07:04:50,697 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1192572885, now seen corresponding path program 1 times [2025-01-09 07:04:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284203193] [2025-01-09 07:04:50,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:50,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:50,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 07:04:50,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 07:04:50,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:50,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284203193] [2025-01-09 07:04:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284203193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74928702] [2025-01-09 07:04:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:51,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:51,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:51,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:51,283 INFO L87 Difference]: Start difference. First operand 1513 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:51,641 INFO L93 Difference]: Finished difference Result 2732 states and 4020 transitions. [2025-01-09 07:04:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:51,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 374 [2025-01-09 07:04:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:51,644 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:51,644 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:51,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:51,645 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 4001 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:51,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4004 Valid, 3870 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4741379310344827) internal successors, (2223), 1508 states have internal predecessors, (2223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2229 transitions. [2025-01-09 07:04:51,664 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2229 transitions. Word has length 374 [2025-01-09 07:04:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:51,664 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2229 transitions. [2025-01-09 07:04:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2229 transitions. [2025-01-09 07:04:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 07:04:51,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:51,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 07:04:51,667 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 762893172, now seen corresponding path program 1 times [2025-01-09 07:04:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:51,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831546893] [2025-01-09 07:04:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:51,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 07:04:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 07:04:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831546893] [2025-01-09 07:04:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831546893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:52,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947148978] [2025-01-09 07:04:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:52,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:52,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:52,157 INFO L87 Difference]: Start difference. First operand 1513 states and 2229 transitions. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:52,519 INFO L93 Difference]: Finished difference Result 2732 states and 4018 transitions. [2025-01-09 07:04:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 375 [2025-01-09 07:04:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:52,522 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:52,522 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:52,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:52,523 INFO L435 NwaCegarLoop]: 1934 mSDtfsCounter, 3993 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:52,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 3870 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:04:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.473474801061008) internal successors, (2222), 1508 states have internal predecessors, (2222), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2228 transitions. [2025-01-09 07:04:52,537 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2228 transitions. Word has length 375 [2025-01-09 07:04:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:52,538 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2228 transitions. [2025-01-09 07:04:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2228 transitions. [2025-01-09 07:04:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-01-09 07:04:52,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:52,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 07:04:52,539 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:52,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1003474436, now seen corresponding path program 1 times [2025-01-09 07:04:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327140735] [2025-01-09 07:04:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-01-09 07:04:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-01-09 07:04:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327140735] [2025-01-09 07:04:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327140735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:04:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318296812] [2025-01-09 07:04:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:04:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:53,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:04:53,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:04:53,363 INFO L87 Difference]: Start difference. First operand 1513 states and 2228 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:53,600 INFO L93 Difference]: Finished difference Result 2732 states and 4016 transitions. [2025-01-09 07:04:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 376 [2025-01-09 07:04:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:53,603 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:53,603 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:53,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:53,604 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 1968 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:53,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1968 Valid, 4126 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4728116710875332) internal successors, (2221), 1508 states have internal predecessors, (2221), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2227 transitions. [2025-01-09 07:04:53,630 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2227 transitions. Word has length 376 [2025-01-09 07:04:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:53,631 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2227 transitions. [2025-01-09 07:04:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2227 transitions. [2025-01-09 07:04:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-01-09 07:04:53,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:53,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:53,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 07:04:53,636 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:53,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1783690565, now seen corresponding path program 1 times [2025-01-09 07:04:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:53,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930791051] [2025-01-09 07:04:53,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:53,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-09 07:04:53,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-09 07:04:53,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:53,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930791051] [2025-01-09 07:04:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930791051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135943637] [2025-01-09 07:04:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:54,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:54,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:54,163 INFO L87 Difference]: Start difference. First operand 1513 states and 2227 transitions. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:54,358 INFO L93 Difference]: Finished difference Result 2760 states and 4055 transitions. [2025-01-09 07:04:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:04:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 377 [2025-01-09 07:04:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:54,360 INFO L225 Difference]: With dead ends: 2760 [2025-01-09 07:04:54,360 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:54,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 07:04:54,361 INFO L435 NwaCegarLoop]: 2203 mSDtfsCounter, 2023 mSDsluCounter, 4269 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 6472 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:54,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 6472 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4721485411140585) internal successors, (2220), 1508 states have internal predecessors, (2220), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2226 transitions. [2025-01-09 07:04:54,377 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2226 transitions. Word has length 377 [2025-01-09 07:04:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:54,378 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2226 transitions. [2025-01-09 07:04:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2226 transitions. [2025-01-09 07:04:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-09 07:04:54,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:54,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 07:04:54,379 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 98619138, now seen corresponding path program 1 times [2025-01-09 07:04:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720643546] [2025-01-09 07:04:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:54,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-01-09 07:04:54,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-01-09 07:04:54,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:54,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720643546] [2025-01-09 07:04:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720643546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:54,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052873514] [2025-01-09 07:04:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:54,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:54,856 INFO L87 Difference]: Start difference. First operand 1513 states and 2226 transitions. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:55,061 INFO L93 Difference]: Finished difference Result 2732 states and 4012 transitions. [2025-01-09 07:04:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 378 [2025-01-09 07:04:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:55,063 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:55,063 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:55,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:55,064 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2210 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:55,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 4133 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4714854111405835) internal successors, (2219), 1508 states have internal predecessors, (2219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2225 transitions. [2025-01-09 07:04:55,085 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2225 transitions. Word has length 378 [2025-01-09 07:04:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:55,085 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2225 transitions. [2025-01-09 07:04:55,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2225 transitions. [2025-01-09 07:04:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-09 07:04:55,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:55,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:55,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 07:04:55,088 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:55,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1470458242, now seen corresponding path program 1 times [2025-01-09 07:04:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:55,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843923733] [2025-01-09 07:04:55,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-09 07:04:55,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-09 07:04:55,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:55,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:55,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843923733] [2025-01-09 07:04:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843923733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:55,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895529283] [2025-01-09 07:04:55,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:55,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:55,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:55,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:55,604 INFO L87 Difference]: Start difference. First operand 1513 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:55,812 INFO L93 Difference]: Finished difference Result 2732 states and 4010 transitions. [2025-01-09 07:04:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 379 [2025-01-09 07:04:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:55,814 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:55,814 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:55,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:55,815 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4191 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:55,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4194 Valid, 4126 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4708222811671088) internal successors, (2218), 1508 states have internal predecessors, (2218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2224 transitions. [2025-01-09 07:04:55,834 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2224 transitions. Word has length 379 [2025-01-09 07:04:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:55,834 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2224 transitions. [2025-01-09 07:04:55,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2224 transitions. [2025-01-09 07:04:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-09 07:04:55,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:55,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:55,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 07:04:55,837 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:55,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1739342505, now seen corresponding path program 1 times [2025-01-09 07:04:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:55,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899146251] [2025-01-09 07:04:55,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:55,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 07:04:56,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 07:04:56,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:56,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899146251] [2025-01-09 07:04:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899146251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27908115] [2025-01-09 07:04:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:56,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:56,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:56,285 INFO L87 Difference]: Start difference. First operand 1513 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:56,533 INFO L93 Difference]: Finished difference Result 2732 states and 4008 transitions. [2025-01-09 07:04:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 380 [2025-01-09 07:04:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:56,535 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:56,535 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:56,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:56,537 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2202 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:56,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 4133 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.470159151193634) internal successors, (2217), 1508 states have internal predecessors, (2217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2223 transitions. [2025-01-09 07:04:56,551 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2223 transitions. Word has length 380 [2025-01-09 07:04:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2223 transitions. [2025-01-09 07:04:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2223 transitions. [2025-01-09 07:04:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 07:04:56,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:56,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:56,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 07:04:56,554 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -253005879, now seen corresponding path program 1 times [2025-01-09 07:04:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704543145] [2025-01-09 07:04:56,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:56,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 07:04:56,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 07:04:56,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:56,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:57,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704543145] [2025-01-09 07:04:57,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704543145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:57,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:57,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16407414] [2025-01-09 07:04:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:57,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:57,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:57,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:57,049 INFO L87 Difference]: Start difference. First operand 1513 states and 2223 transitions. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:57,261 INFO L93 Difference]: Finished difference Result 2732 states and 4006 transitions. [2025-01-09 07:04:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 381 [2025-01-09 07:04:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:57,264 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:57,264 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:57,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:57,265 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4175 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:57,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 4126 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.469496021220159) internal successors, (2216), 1508 states have internal predecessors, (2216), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2222 transitions. [2025-01-09 07:04:57,280 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2222 transitions. Word has length 381 [2025-01-09 07:04:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2222 transitions. [2025-01-09 07:04:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2222 transitions. [2025-01-09 07:04:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 07:04:57,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:57,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 07:04:57,282 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1941703216, now seen corresponding path program 1 times [2025-01-09 07:04:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465176199] [2025-01-09 07:04:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:57,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 07:04:57,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 07:04:57,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:57,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:57,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465176199] [2025-01-09 07:04:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465176199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366750183] [2025-01-09 07:04:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:57,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:57,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:57,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:57,720 INFO L87 Difference]: Start difference. First operand 1513 states and 2222 transitions. Second operand has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:57,933 INFO L93 Difference]: Finished difference Result 2732 states and 4004 transitions. [2025-01-09 07:04:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 382 [2025-01-09 07:04:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:57,938 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:57,938 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:57,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:57,942 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4167 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:57,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 4126 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4688328912466844) internal successors, (2215), 1508 states have internal predecessors, (2215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2221 transitions. [2025-01-09 07:04:57,968 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2221 transitions. Word has length 382 [2025-01-09 07:04:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2221 transitions. [2025-01-09 07:04:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.0) internal successors, (370), 5 states have internal predecessors, (370), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2221 transitions. [2025-01-09 07:04:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-09 07:04:57,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:57,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 07:04:57,973 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:57,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -865739376, now seen corresponding path program 1 times [2025-01-09 07:04:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142022726] [2025-01-09 07:04:57,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:58,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-09 07:04:58,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-09 07:04:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142022726] [2025-01-09 07:04:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142022726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247543710] [2025-01-09 07:04:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:58,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:58,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:58,432 INFO L87 Difference]: Start difference. First operand 1513 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:58,641 INFO L93 Difference]: Finished difference Result 2732 states and 4002 transitions. [2025-01-09 07:04:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 383 [2025-01-09 07:04:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:58,644 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:58,644 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:58,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:58,645 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4159 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:58,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 4126 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4681697612732096) internal successors, (2214), 1508 states have internal predecessors, (2214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2220 transitions. [2025-01-09 07:04:58,657 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2220 transitions. Word has length 383 [2025-01-09 07:04:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2220 transitions. [2025-01-09 07:04:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2220 transitions. [2025-01-09 07:04:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-09 07:04:58,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:58,660 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 07:04:58,660 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:58,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2056345481, now seen corresponding path program 1 times [2025-01-09 07:04:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105537522] [2025-01-09 07:04:58,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:58,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-09 07:04:58,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-09 07:04:58,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:58,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:59,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105537522] [2025-01-09 07:04:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105537522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650181000] [2025-01-09 07:04:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:59,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:59,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:59,136 INFO L87 Difference]: Start difference. First operand 1513 states and 2220 transitions. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:04:59,338 INFO L93 Difference]: Finished difference Result 2732 states and 4000 transitions. [2025-01-09 07:04:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:04:59,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 384 [2025-01-09 07:04:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:04:59,340 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:04:59,341 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:04:59,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:04:59,342 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2186 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:04:59,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 4133 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:04:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:04:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:04:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4675066312997347) internal successors, (2213), 1508 states have internal predecessors, (2213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:04:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2219 transitions. [2025-01-09 07:04:59,356 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2219 transitions. Word has length 384 [2025-01-09 07:04:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:04:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2219 transitions. [2025-01-09 07:04:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:04:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2219 transitions. [2025-01-09 07:04:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 07:04:59,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:04:59,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:04:59,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 07:04:59,358 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:04:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:04:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 538538711, now seen corresponding path program 1 times [2025-01-09 07:04:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:04:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061437932] [2025-01-09 07:04:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:04:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:04:59,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 07:04:59,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 07:04:59,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:04:59,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:04:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:04:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:04:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061437932] [2025-01-09 07:04:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061437932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:04:59,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:04:59,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:04:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963041264] [2025-01-09 07:04:59,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:04:59,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:04:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:04:59,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:04:59,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:04:59,802 INFO L87 Difference]: Start difference. First operand 1513 states and 2219 transitions. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:00,024 INFO L93 Difference]: Finished difference Result 2732 states and 3998 transitions. [2025-01-09 07:05:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 385 [2025-01-09 07:05:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:00,026 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:00,026 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:00,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:00,028 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2182 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:00,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 4133 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.46684350132626) internal successors, (2212), 1508 states have internal predecessors, (2212), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2218 transitions. [2025-01-09 07:05:00,040 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2218 transitions. Word has length 385 [2025-01-09 07:05:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2218 transitions. [2025-01-09 07:05:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2218 transitions. [2025-01-09 07:05:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-01-09 07:05:00,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:00,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:00,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 07:05:00,043 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:00,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash 328407710, now seen corresponding path program 1 times [2025-01-09 07:05:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:00,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931962156] [2025-01-09 07:05:00,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:00,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-09 07:05:00,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-09 07:05:00,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:05:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:05:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:05:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931962156] [2025-01-09 07:05:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931962156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:05:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:05:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:05:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10319905] [2025-01-09 07:05:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:05:00,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:05:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:05:00,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:05:00,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:05:00,498 INFO L87 Difference]: Start difference. First operand 1513 states and 2218 transitions. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:00,705 INFO L93 Difference]: Finished difference Result 2732 states and 3996 transitions. [2025-01-09 07:05:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 386 [2025-01-09 07:05:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:00,708 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:00,708 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:00,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:00,709 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4135 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:00,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4126 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4661803713527852) internal successors, (2211), 1508 states have internal predecessors, (2211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2217 transitions. [2025-01-09 07:05:00,720 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2217 transitions. Word has length 386 [2025-01-09 07:05:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2217 transitions. [2025-01-09 07:05:00,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2217 transitions. [2025-01-09 07:05:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 07:05:00,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:00,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 07:05:00,722 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -852824162, now seen corresponding path program 1 times [2025-01-09 07:05:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995080115] [2025-01-09 07:05:00,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:00,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 07:05:00,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 07:05:00,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:00,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:05:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:05:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:05:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995080115] [2025-01-09 07:05:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995080115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:05:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:05:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:05:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030514004] [2025-01-09 07:05:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:05:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:05:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:05:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:05:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:05:01,404 INFO L87 Difference]: Start difference. First operand 1513 states and 2217 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:01,630 INFO L93 Difference]: Finished difference Result 2732 states and 3994 transitions. [2025-01-09 07:05:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 387 [2025-01-09 07:05:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:01,633 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:01,633 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:01,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:01,634 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2174 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:01,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 4133 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4655172413793103) internal successors, (2210), 1508 states have internal predecessors, (2210), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2216 transitions. [2025-01-09 07:05:01,650 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2216 transitions. Word has length 387 [2025-01-09 07:05:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:01,650 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2216 transitions. [2025-01-09 07:05:01,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2216 transitions. [2025-01-09 07:05:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-01-09 07:05:01,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:01,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 07:05:01,653 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:01,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1514664891, now seen corresponding path program 1 times [2025-01-09 07:05:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273062266] [2025-01-09 07:05:01,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:01,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-09 07:05:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-09 07:05:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:05:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:05:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:05:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273062266] [2025-01-09 07:05:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273062266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:05:02,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:05:02,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:05:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129272396] [2025-01-09 07:05:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:05:02,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:05:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:05:02,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:05:02,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:05:02,107 INFO L87 Difference]: Start difference. First operand 1513 states and 2216 transitions. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:02,310 INFO L93 Difference]: Finished difference Result 2732 states and 3992 transitions. [2025-01-09 07:05:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:02,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 388 [2025-01-09 07:05:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:02,313 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:02,313 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:02,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:02,315 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2170 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:02,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 4133 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4648541114058355) internal successors, (2209), 1508 states have internal predecessors, (2209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2215 transitions. [2025-01-09 07:05:02,329 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2215 transitions. Word has length 388 [2025-01-09 07:05:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:02,330 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2215 transitions. [2025-01-09 07:05:02,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2215 transitions. [2025-01-09 07:05:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 07:05:02,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:02,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 07:05:02,332 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1071584229, now seen corresponding path program 1 times [2025-01-09 07:05:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855398769] [2025-01-09 07:05:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:02,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 07:05:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 07:05:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:05:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:05:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:05:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855398769] [2025-01-09 07:05:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855398769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:05:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:05:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:05:02,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106056513] [2025-01-09 07:05:02,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:05:02,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:05:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:05:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:05:02,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:05:02,817 INFO L87 Difference]: Start difference. First operand 1513 states and 2215 transitions. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:03,017 INFO L93 Difference]: Finished difference Result 2732 states and 3990 transitions. [2025-01-09 07:05:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:03,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 389 [2025-01-09 07:05:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:03,019 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:03,019 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:03,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:03,021 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 2166 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:03,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 4133 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4641909814323608) internal successors, (2208), 1508 states have internal predecessors, (2208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2214 transitions. [2025-01-09 07:05:03,034 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2214 transitions. Word has length 389 [2025-01-09 07:05:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:03,034 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2214 transitions. [2025-01-09 07:05:03,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2214 transitions. [2025-01-09 07:05:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 07:05:03,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:03,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:03,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 07:05:03,036 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1501838700, now seen corresponding path program 1 times [2025-01-09 07:05:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315416683] [2025-01-09 07:05:03,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:03,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 07:05:03,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 07:05:03,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:03,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:05:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 07:05:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:05:03,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315416683] [2025-01-09 07:05:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315416683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:05:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:05:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:05:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72199456] [2025-01-09 07:05:03,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:05:03,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:05:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:05:03,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:05:03,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:05:03,537 INFO L87 Difference]: Start difference. First operand 1513 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:05:03,754 INFO L93 Difference]: Finished difference Result 2732 states and 3988 transitions. [2025-01-09 07:05:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:05:03,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 390 [2025-01-09 07:05:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:05:03,757 INFO L225 Difference]: With dead ends: 2732 [2025-01-09 07:05:03,757 INFO L226 Difference]: Without dead ends: 1513 [2025-01-09 07:05:03,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:05:03,760 INFO L435 NwaCegarLoop]: 2062 mSDtfsCounter, 4103 mSDsluCounter, 2064 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:05:03,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4126 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:05:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-01-09 07:05:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-01-09 07:05:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1508 states have (on average 1.4635278514588859) internal successors, (2207), 1508 states have internal predecessors, (2207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 07:05:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2213 transitions. [2025-01-09 07:05:03,777 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2213 transitions. Word has length 390 [2025-01-09 07:05:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:05:03,778 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2213 transitions. [2025-01-09 07:05:03,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 07:05:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2213 transitions. [2025-01-09 07:05:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-09 07:05:03,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:05:03,780 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 07:05:03,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 07:05:03,781 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:05:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:05:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1335533484, now seen corresponding path program 1 times [2025-01-09 07:05:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:05:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336035335] [2025-01-09 07:05:03,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:05:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:05:03,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 07:05:03,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 07:05:03,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:05:03,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat