./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21d3b5f5f45e838fe2a280802b5788520d014c57271d384acd297e13beb553d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:28:59,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:28:59,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:28:59,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:28:59,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:28:59,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:28:59,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:28:59,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:28:59,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:28:59,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:28:59,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:28:59,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:28:59,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:28:59,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:28:59,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:28:59,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:28:59,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:28:59,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:28:59,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:28:59,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:28:59,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:28:59,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:28:59,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:28:59,623 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21d3b5f5f45e838fe2a280802b5788520d014c57271d384acd297e13beb553d8 [2025-03-03 18:28:59,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:28:59,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:28:59,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:28:59,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:28:59,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:28:59,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c [2025-03-03 18:29:01,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60eea7506/06f8243fc3374833ad7307e5abd9a326/FLAGba823af7d [2025-03-03 18:29:01,349 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:29:01,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c [2025-03-03 18:29:01,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60eea7506/06f8243fc3374833ad7307e5abd9a326/FLAGba823af7d [2025-03-03 18:29:01,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60eea7506/06f8243fc3374833ad7307e5abd9a326 [2025-03-03 18:29:01,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:29:01,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:29:01,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:01,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:29:01,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:29:01,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:01,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63795ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01, skipping insertion in model container [2025-03-03 18:29:01,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:01,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:29:01,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c[1254,1267] [2025-03-03 18:29:01,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:01,676 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:29:01,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_ibuf.c[1254,1267] [2025-03-03 18:29:01,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:01,761 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:29:01,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01 WrapperNode [2025-03-03 18:29:01,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:01,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:01,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:29:01,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:29:01,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:01,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:01,969 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1659 [2025-03-03 18:29:01,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:01,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:29:01,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:29:01,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:29:01,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:01,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:29:02,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:29:02,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:29:02,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:29:02,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:29:02,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (1/1) ... [2025-03-03 18:29:02,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:02,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:02,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:29:02,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:29:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:29:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:29:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:29:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:29:02,337 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:29:02,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:29:03,755 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2025-03-03 18:29:03,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:29:03,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:29:03,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:29:03,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:03 BoogieIcfgContainer [2025-03-03 18:29:03,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:29:03,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:29:03,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:29:03,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:29:03,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:29:01" (1/3) ... [2025-03-03 18:29:03,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bd5325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:03, skipping insertion in model container [2025-03-03 18:29:03,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:01" (2/3) ... [2025-03-03 18:29:03,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47bd5325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:03, skipping insertion in model container [2025-03-03 18:29:03,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:03" (3/3) ... [2025-03-03 18:29:03,861 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_ibuf.c [2025-03-03 18:29:03,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:29:03,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_ibuf.c that has 1 procedures, 546 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:29:03,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:29:03,934 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;@731560a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:29:03,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:29:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 544 states have (on average 1.4981617647058822) internal successors, (815), 545 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:29:03,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:03,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:03,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1133565809, now seen corresponding path program 1 times [2025-03-03 18:29:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880635504] [2025-03-03 18:29:03,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:29:04,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:29:04,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:04,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:04,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880635504] [2025-03-03 18:29:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880635504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650988538] [2025-03-03 18:29:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:04,748 INFO L87 Difference]: Start difference. First operand has 546 states, 544 states have (on average 1.4981617647058822) internal successors, (815), 545 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:05,047 INFO L93 Difference]: Finished difference Result 1081 states and 1617 transitions. [2025-03-03 18:29:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 18:29:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:05,060 INFO L225 Difference]: With dead ends: 1081 [2025-03-03 18:29:05,060 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 18:29:05,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:05,068 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 0 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2020 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 18:29:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 18:29:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.494485294117647) internal successors, (813), 544 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 813 transitions. [2025-03-03 18:29:05,124 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 813 transitions. Word has length 53 [2025-03-03 18:29:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:05,124 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 813 transitions. [2025-03-03 18:29:05,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 813 transitions. [2025-03-03 18:29:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:29:05,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:05,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:29:05,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:05,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -776121796, now seen corresponding path program 1 times [2025-03-03 18:29:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899787641] [2025-03-03 18:29:05,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:05,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:29:05,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:29:05,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:05,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899787641] [2025-03-03 18:29:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899787641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:05,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:05,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954064883] [2025-03-03 18:29:05,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:05,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:05,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:05,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:05,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:05,365 INFO L87 Difference]: Start difference. First operand 545 states and 813 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:05,628 INFO L93 Difference]: Finished difference Result 1082 states and 1615 transitions. [2025-03-03 18:29:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 18:29:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:05,632 INFO L225 Difference]: With dead ends: 1082 [2025-03-03 18:29:05,632 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 18:29:05,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:05,635 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 0 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:05,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2017 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 18:29:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-03 18:29:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.4926739926739927) internal successors, (815), 546 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 815 transitions. [2025-03-03 18:29:05,659 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 815 transitions. Word has length 54 [2025-03-03 18:29:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:05,659 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 815 transitions. [2025-03-03 18:29:05,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 815 transitions. [2025-03-03 18:29:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:29:05,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:05,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:29:05,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -653429206, now seen corresponding path program 1 times [2025-03-03 18:29:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036385334] [2025-03-03 18:29:05,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:05,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:29:05,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:29:05,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:05,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036385334] [2025-03-03 18:29:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036385334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:06,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886110344] [2025-03-03 18:29:06,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:06,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:06,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:06,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:06,078 INFO L87 Difference]: Start difference. First operand 547 states and 815 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:06,394 INFO L93 Difference]: Finished difference Result 1088 states and 1622 transitions. [2025-03-03 18:29:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:06,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 18:29:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:06,397 INFO L225 Difference]: With dead ends: 1088 [2025-03-03 18:29:06,397 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 18:29:06,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:06,398 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 689 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:06,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1990 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 18:29:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-03-03 18:29:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4908759124087592) internal successors, (817), 548 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 817 transitions. [2025-03-03 18:29:06,408 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 817 transitions. Word has length 55 [2025-03-03 18:29:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:06,408 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 817 transitions. [2025-03-03 18:29:06,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 817 transitions. [2025-03-03 18:29:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:06,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:06,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:06,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:29:06,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:06,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1609465370, now seen corresponding path program 1 times [2025-03-03 18:29:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465878913] [2025-03-03 18:29:06,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465878913] [2025-03-03 18:29:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465878913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:06,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:06,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645255805] [2025-03-03 18:29:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:06,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:06,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:06,822 INFO L87 Difference]: Start difference. First operand 549 states and 817 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:07,328 INFO L93 Difference]: Finished difference Result 1478 states and 2200 transitions. [2025-03-03 18:29:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 18:29:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:07,332 INFO L225 Difference]: With dead ends: 1478 [2025-03-03 18:29:07,332 INFO L226 Difference]: Without dead ends: 939 [2025-03-03 18:29:07,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:07,334 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 543 mSDsluCounter, 3097 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 3761 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:07,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 3761 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-03 18:29:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 624. [2025-03-03 18:29:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.4879614767255216) internal successors, (927), 623 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 927 transitions. [2025-03-03 18:29:07,357 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 927 transitions. Word has length 56 [2025-03-03 18:29:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 927 transitions. [2025-03-03 18:29:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 927 transitions. [2025-03-03 18:29:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:07,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:07,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:29:07,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:07,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:07,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1727862038, now seen corresponding path program 1 times [2025-03-03 18:29:07,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:07,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074155533] [2025-03-03 18:29:07,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:07,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:07,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:07,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:07,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:07,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:07,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074155533] [2025-03-03 18:29:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074155533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276769347] [2025-03-03 18:29:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:07,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:07,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:07,607 INFO L87 Difference]: Start difference. First operand 624 states and 927 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:08,074 INFO L93 Difference]: Finished difference Result 1565 states and 2327 transitions. [2025-03-03 18:29:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:08,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 18:29:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:08,078 INFO L225 Difference]: With dead ends: 1565 [2025-03-03 18:29:08,078 INFO L226 Difference]: Without dead ends: 1011 [2025-03-03 18:29:08,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:08,079 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 711 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:08,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3300 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-03 18:29:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 620. [2025-03-03 18:29:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4862681744749595) internal successors, (920), 619 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 920 transitions. [2025-03-03 18:29:08,094 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 920 transitions. Word has length 57 [2025-03-03 18:29:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:08,095 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 920 transitions. [2025-03-03 18:29:08,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 920 transitions. [2025-03-03 18:29:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:08,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:08,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:29:08,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1825107877, now seen corresponding path program 1 times [2025-03-03 18:29:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448337105] [2025-03-03 18:29:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:08,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:08,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:08,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448337105] [2025-03-03 18:29:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448337105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386258599] [2025-03-03 18:29:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:08,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:08,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:08,340 INFO L87 Difference]: Start difference. First operand 620 states and 920 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:08,580 INFO L93 Difference]: Finished difference Result 1163 states and 1729 transitions. [2025-03-03 18:29:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 18:29:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:08,583 INFO L225 Difference]: With dead ends: 1163 [2025-03-03 18:29:08,583 INFO L226 Difference]: Without dead ends: 624 [2025-03-03 18:29:08,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:08,585 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 768 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:08,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2016 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-03 18:29:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 623. [2025-03-03 18:29:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 923 transitions. [2025-03-03 18:29:08,597 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 923 transitions. Word has length 57 [2025-03-03 18:29:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:08,598 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 923 transitions. [2025-03-03 18:29:08,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 923 transitions. [2025-03-03 18:29:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:08,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:08,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:29:08,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1104912571, now seen corresponding path program 1 times [2025-03-03 18:29:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089949863] [2025-03-03 18:29:08,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:08,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:08,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:08,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089949863] [2025-03-03 18:29:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089949863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:08,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179829584] [2025-03-03 18:29:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:08,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:08,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:08,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:08,928 INFO L87 Difference]: Start difference. First operand 623 states and 923 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:09,291 INFO L93 Difference]: Finished difference Result 1212 states and 1796 transitions. [2025-03-03 18:29:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 18:29:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:09,293 INFO L225 Difference]: With dead ends: 1212 [2025-03-03 18:29:09,293 INFO L226 Difference]: Without dead ends: 622 [2025-03-03 18:29:09,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:09,295 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 86 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:09,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 3315 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-03 18:29:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2025-03-03 18:29:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.4814814814814814) internal successors, (920), 621 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 920 transitions. [2025-03-03 18:29:09,309 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 920 transitions. Word has length 58 [2025-03-03 18:29:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:09,309 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 920 transitions. [2025-03-03 18:29:09,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 920 transitions. [2025-03-03 18:29:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:09,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:09,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:09,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:29:09,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:09,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1411176670, now seen corresponding path program 1 times [2025-03-03 18:29:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005122194] [2025-03-03 18:29:09,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:09,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005122194] [2025-03-03 18:29:09,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005122194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:09,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:09,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850852007] [2025-03-03 18:29:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:09,604 INFO L87 Difference]: Start difference. First operand 622 states and 920 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:10,098 INFO L93 Difference]: Finished difference Result 1613 states and 2390 transitions. [2025-03-03 18:29:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 18:29:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:10,101 INFO L225 Difference]: With dead ends: 1613 [2025-03-03 18:29:10,101 INFO L226 Difference]: Without dead ends: 1051 [2025-03-03 18:29:10,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:10,103 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 715 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:10,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 3895 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-03 18:29:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 625. [2025-03-03 18:29:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4791666666666667) internal successors, (923), 624 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 923 transitions. [2025-03-03 18:29:10,112 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 923 transitions. Word has length 59 [2025-03-03 18:29:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:10,112 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 923 transitions. [2025-03-03 18:29:10,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 923 transitions. [2025-03-03 18:29:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:10,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:29:10,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -458515778, now seen corresponding path program 1 times [2025-03-03 18:29:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283325915] [2025-03-03 18:29:10,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:10,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283325915] [2025-03-03 18:29:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283325915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:10,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:10,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636933856] [2025-03-03 18:29:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:10,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:10,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:10,456 INFO L87 Difference]: Start difference. First operand 625 states and 923 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:10,835 INFO L93 Difference]: Finished difference Result 1201 states and 1775 transitions. [2025-03-03 18:29:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 18:29:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:10,837 INFO L225 Difference]: With dead ends: 1201 [2025-03-03 18:29:10,837 INFO L226 Difference]: Without dead ends: 625 [2025-03-03 18:29:10,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:10,838 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 71 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:10,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3315 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-03 18:29:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2025-03-03 18:29:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4775641025641026) internal successors, (922), 624 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 922 transitions. [2025-03-03 18:29:10,849 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 922 transitions. Word has length 60 [2025-03-03 18:29:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 922 transitions. [2025-03-03 18:29:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 922 transitions. [2025-03-03 18:29:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:29:10,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:10,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:10,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:29:10,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 340737549, now seen corresponding path program 1 times [2025-03-03 18:29:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469606958] [2025-03-03 18:29:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:10,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:29:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:29:10,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:10,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469606958] [2025-03-03 18:29:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469606958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180880724] [2025-03-03 18:29:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:11,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:11,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:11,075 INFO L87 Difference]: Start difference. First operand 625 states and 922 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:11,368 INFO L93 Difference]: Finished difference Result 1236 states and 1824 transitions. [2025-03-03 18:29:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 18:29:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:11,370 INFO L225 Difference]: With dead ends: 1236 [2025-03-03 18:29:11,371 INFO L226 Difference]: Without dead ends: 625 [2025-03-03 18:29:11,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:11,372 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 15 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:11,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2672 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-03 18:29:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2025-03-03 18:29:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4759615384615385) internal successors, (921), 624 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 921 transitions. [2025-03-03 18:29:11,383 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 921 transitions. Word has length 61 [2025-03-03 18:29:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:11,383 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 921 transitions. [2025-03-03 18:29:11,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 921 transitions. [2025-03-03 18:29:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:29:11,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:11,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:29:11,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -134103869, now seen corresponding path program 1 times [2025-03-03 18:29:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541102456] [2025-03-03 18:29:11,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:29:11,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:29:11,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:11,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541102456] [2025-03-03 18:29:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541102456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:11,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:11,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:29:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53599522] [2025-03-03 18:29:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:11,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:11,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:11,975 INFO L87 Difference]: Start difference. First operand 625 states and 921 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:12,846 INFO L93 Difference]: Finished difference Result 1243 states and 1834 transitions. [2025-03-03 18:29:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:29:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 18:29:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:12,849 INFO L225 Difference]: With dead ends: 1243 [2025-03-03 18:29:12,849 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 18:29:12,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:29:12,851 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 21 mSDsluCounter, 7176 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7834 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:12,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7834 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:29:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 18:29:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2025-03-03 18:29:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.4748427672955975) internal successors, (938), 636 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 938 transitions. [2025-03-03 18:29:12,873 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 938 transitions. Word has length 62 [2025-03-03 18:29:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 938 transitions. [2025-03-03 18:29:12,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 938 transitions. [2025-03-03 18:29:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:29:12,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:12,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:12,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:29:12,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1194279149, now seen corresponding path program 1 times [2025-03-03 18:29:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845506409] [2025-03-03 18:29:12,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:29:12,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:29:12,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:12,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845506409] [2025-03-03 18:29:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845506409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861467537] [2025-03-03 18:29:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:13,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:13,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:13,154 INFO L87 Difference]: Start difference. First operand 637 states and 938 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:13,438 INFO L93 Difference]: Finished difference Result 1245 states and 1835 transitions. [2025-03-03 18:29:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 18:29:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:13,440 INFO L225 Difference]: With dead ends: 1245 [2025-03-03 18:29:13,440 INFO L226 Difference]: Without dead ends: 633 [2025-03-03 18:29:13,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:13,442 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 11 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:13,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2674 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-03 18:29:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-03-03 18:29:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4731012658227849) internal successors, (931), 632 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 931 transitions. [2025-03-03 18:29:13,451 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 931 transitions. Word has length 63 [2025-03-03 18:29:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 931 transitions. [2025-03-03 18:29:13,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 931 transitions. [2025-03-03 18:29:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:29:13,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:13,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:29:13,452 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:13,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1869186375, now seen corresponding path program 1 times [2025-03-03 18:29:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353438173] [2025-03-03 18:29:13,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:13,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:29:13,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:29:13,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:13,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353438173] [2025-03-03 18:29:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353438173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:13,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:13,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767530398] [2025-03-03 18:29:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:13,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:13,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:13,654 INFO L87 Difference]: Start difference. First operand 633 states and 931 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:14,102 INFO L93 Difference]: Finished difference Result 1237 states and 1822 transitions. [2025-03-03 18:29:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 18:29:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:14,104 INFO L225 Difference]: With dead ends: 1237 [2025-03-03 18:29:14,104 INFO L226 Difference]: Without dead ends: 649 [2025-03-03 18:29:14,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:14,106 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 6 mSDsluCounter, 4003 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:14,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4674 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-03 18:29:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2025-03-03 18:29:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4688473520249221) internal successors, (943), 642 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 943 transitions. [2025-03-03 18:29:14,117 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 943 transitions. Word has length 63 [2025-03-03 18:29:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:14,117 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 943 transitions. [2025-03-03 18:29:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 943 transitions. [2025-03-03 18:29:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 18:29:14,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:14,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:14,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:29:14,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:14,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1621971299, now seen corresponding path program 1 times [2025-03-03 18:29:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871560133] [2025-03-03 18:29:14,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:14,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 18:29:14,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 18:29:14,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:14,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:14,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871560133] [2025-03-03 18:29:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871560133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631403074] [2025-03-03 18:29:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:14,438 INFO L87 Difference]: Start difference. First operand 643 states and 943 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:15,005 INFO L93 Difference]: Finished difference Result 1626 states and 2398 transitions. [2025-03-03 18:29:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 18:29:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:15,009 INFO L225 Difference]: With dead ends: 1626 [2025-03-03 18:29:15,009 INFO L226 Difference]: Without dead ends: 1036 [2025-03-03 18:29:15,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:15,011 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 708 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 3909 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:15,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3909 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-03 18:29:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 642. [2025-03-03 18:29:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.466458658346334) internal successors, (940), 641 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 940 transitions. [2025-03-03 18:29:15,025 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 940 transitions. Word has length 64 [2025-03-03 18:29:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:15,025 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 940 transitions. [2025-03-03 18:29:15,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 940 transitions. [2025-03-03 18:29:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 18:29:15,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:15,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:15,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:29:15,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash -954599746, now seen corresponding path program 1 times [2025-03-03 18:29:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:15,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438510999] [2025-03-03 18:29:15,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:15,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 18:29:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 18:29:15,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438510999] [2025-03-03 18:29:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438510999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402828779] [2025-03-03 18:29:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:15,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:15,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:15,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:15,234 INFO L87 Difference]: Start difference. First operand 642 states and 940 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:15,626 INFO L93 Difference]: Finished difference Result 1243 states and 1826 transitions. [2025-03-03 18:29:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 18:29:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:15,629 INFO L225 Difference]: With dead ends: 1243 [2025-03-03 18:29:15,629 INFO L226 Difference]: Without dead ends: 658 [2025-03-03 18:29:15,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:15,630 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 6 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:15,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4009 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-03 18:29:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 652. [2025-03-03 18:29:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.4623655913978495) internal successors, (952), 651 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 952 transitions. [2025-03-03 18:29:15,640 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 952 transitions. Word has length 65 [2025-03-03 18:29:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:15,640 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 952 transitions. [2025-03-03 18:29:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 952 transitions. [2025-03-03 18:29:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 18:29:15,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:15,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:15,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:29:15,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:15,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1157777362, now seen corresponding path program 1 times [2025-03-03 18:29:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698577427] [2025-03-03 18:29:15,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:15,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 18:29:15,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 18:29:15,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:15,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698577427] [2025-03-03 18:29:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698577427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344113569] [2025-03-03 18:29:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:15,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:15,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:15,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:15,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:15,932 INFO L87 Difference]: Start difference. First operand 652 states and 952 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:16,544 INFO L93 Difference]: Finished difference Result 1601 states and 2346 transitions. [2025-03-03 18:29:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 18:29:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:16,547 INFO L225 Difference]: With dead ends: 1601 [2025-03-03 18:29:16,547 INFO L226 Difference]: Without dead ends: 964 [2025-03-03 18:29:16,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:16,549 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 550 mSDsluCounter, 4599 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:16,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 5259 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-03 18:29:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 646. [2025-03-03 18:29:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.4573643410852712) internal successors, (940), 645 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 940 transitions. [2025-03-03 18:29:16,561 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 940 transitions. Word has length 65 [2025-03-03 18:29:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:16,561 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 940 transitions. [2025-03-03 18:29:16,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 940 transitions. [2025-03-03 18:29:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 18:29:16,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:16,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:29:16,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1090098503, now seen corresponding path program 1 times [2025-03-03 18:29:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280787867] [2025-03-03 18:29:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:16,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 18:29:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 18:29:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:17,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:17,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280787867] [2025-03-03 18:29:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280787867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:17,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240010136] [2025-03-03 18:29:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:17,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:17,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:17,007 INFO L87 Difference]: Start difference. First operand 646 states and 940 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:17,573 INFO L93 Difference]: Finished difference Result 1681 states and 2466 transitions. [2025-03-03 18:29:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:17,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 18:29:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:17,576 INFO L225 Difference]: With dead ends: 1681 [2025-03-03 18:29:17,576 INFO L226 Difference]: Without dead ends: 1058 [2025-03-03 18:29:17,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:17,577 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 707 mSDsluCounter, 3953 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 4615 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:17,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 4615 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-03 18:29:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 632. [2025-03-03 18:29:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4595879556259905) internal successors, (921), 631 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 921 transitions. [2025-03-03 18:29:17,595 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 921 transitions. Word has length 65 [2025-03-03 18:29:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:17,595 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 921 transitions. [2025-03-03 18:29:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 921 transitions. [2025-03-03 18:29:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 18:29:17,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:17,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:29:17,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1694527288, now seen corresponding path program 1 times [2025-03-03 18:29:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421855344] [2025-03-03 18:29:17,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 18:29:17,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 18:29:17,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:17,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421855344] [2025-03-03 18:29:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421855344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492672860] [2025-03-03 18:29:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:17,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:17,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:17,774 INFO L87 Difference]: Start difference. First operand 632 states and 921 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:18,206 INFO L93 Difference]: Finished difference Result 1232 states and 1806 transitions. [2025-03-03 18:29:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:18,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 18:29:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:18,209 INFO L225 Difference]: With dead ends: 1232 [2025-03-03 18:29:18,209 INFO L226 Difference]: Without dead ends: 650 [2025-03-03 18:29:18,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:18,210 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 6 mSDsluCounter, 3999 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:18,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4669 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-03 18:29:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 642. [2025-03-03 18:29:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4570982839313573) internal successors, (934), 641 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 934 transitions. [2025-03-03 18:29:18,218 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 934 transitions. Word has length 66 [2025-03-03 18:29:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:18,218 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 934 transitions. [2025-03-03 18:29:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 934 transitions. [2025-03-03 18:29:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 18:29:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:18,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:29:18,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:18,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1558281297, now seen corresponding path program 1 times [2025-03-03 18:29:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386213909] [2025-03-03 18:29:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:18,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 18:29:18,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 18:29:18,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386213909] [2025-03-03 18:29:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386213909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703095329] [2025-03-03 18:29:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:18,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:18,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:18,524 INFO L87 Difference]: Start difference. First operand 642 states and 934 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:19,074 INFO L93 Difference]: Finished difference Result 1678 states and 2458 transitions. [2025-03-03 18:29:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 18:29:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:19,077 INFO L225 Difference]: With dead ends: 1678 [2025-03-03 18:29:19,077 INFO L226 Difference]: Without dead ends: 1056 [2025-03-03 18:29:19,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:19,078 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1222 mSDsluCounter, 4036 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 4691 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:19,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 4691 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-03 18:29:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 642. [2025-03-03 18:29:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4555382215288613) internal successors, (933), 641 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 933 transitions. [2025-03-03 18:29:19,087 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 933 transitions. Word has length 66 [2025-03-03 18:29:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:19,087 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 933 transitions. [2025-03-03 18:29:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 933 transitions. [2025-03-03 18:29:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 18:29:19,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:19,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:29:19,088 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1880257324, now seen corresponding path program 1 times [2025-03-03 18:29:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489809743] [2025-03-03 18:29:19,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:19,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 18:29:19,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 18:29:19,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:19,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489809743] [2025-03-03 18:29:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489809743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:29:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911378054] [2025-03-03 18:29:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:29:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:19,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:29:19,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:29:19,680 INFO L87 Difference]: Start difference. First operand 642 states and 933 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:20,445 INFO L93 Difference]: Finished difference Result 1244 states and 1820 transitions. [2025-03-03 18:29:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:29:20,446 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 18:29:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:20,448 INFO L225 Difference]: With dead ends: 1244 [2025-03-03 18:29:20,448 INFO L226 Difference]: Without dead ends: 636 [2025-03-03 18:29:20,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:20,449 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 10 mSDsluCounter, 7162 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7822 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:20,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 7822 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:29:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-03 18:29:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-03-03 18:29:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.4566929133858268) internal successors, (925), 635 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 925 transitions. [2025-03-03 18:29:20,456 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 925 transitions. Word has length 67 [2025-03-03 18:29:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 925 transitions. [2025-03-03 18:29:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 925 transitions. [2025-03-03 18:29:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 18:29:20,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:20,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:29:20,457 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 155527843, now seen corresponding path program 1 times [2025-03-03 18:29:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560257724] [2025-03-03 18:29:20,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:20,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:29:20,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:29:20,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:20,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560257724] [2025-03-03 18:29:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560257724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319046031] [2025-03-03 18:29:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:20,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:20,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:20,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:20,647 INFO L87 Difference]: Start difference. First operand 636 states and 925 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,045 INFO L93 Difference]: Finished difference Result 1237 states and 1812 transitions. [2025-03-03 18:29:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 18:29:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,047 INFO L225 Difference]: With dead ends: 1237 [2025-03-03 18:29:21,047 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 18:29:21,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:21,048 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 10 mSDsluCounter, 3995 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4664 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 18:29:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 657. [2025-03-03 18:29:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.454268292682927) internal successors, (954), 656 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 954 transitions. [2025-03-03 18:29:21,055 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 954 transitions. Word has length 68 [2025-03-03 18:29:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,055 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 954 transitions. [2025-03-03 18:29:21,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 954 transitions. [2025-03-03 18:29:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 18:29:21,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:29:21,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash 381961310, now seen corresponding path program 1 times [2025-03-03 18:29:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821778454] [2025-03-03 18:29:21,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:29:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:29:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821778454] [2025-03-03 18:29:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821778454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:21,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846842625] [2025-03-03 18:29:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:21,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:21,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:21,186 INFO L87 Difference]: Start difference. First operand 657 states and 954 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,609 INFO L93 Difference]: Finished difference Result 1638 states and 2406 transitions. [2025-03-03 18:29:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 18:29:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,614 INFO L225 Difference]: With dead ends: 1638 [2025-03-03 18:29:21,615 INFO L226 Difference]: Without dead ends: 1040 [2025-03-03 18:29:21,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:21,616 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 655 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 3301 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-03 18:29:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 646. [2025-03-03 18:29:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.449612403100775) internal successors, (935), 645 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 935 transitions. [2025-03-03 18:29:21,625 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 935 transitions. Word has length 68 [2025-03-03 18:29:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,625 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 935 transitions. [2025-03-03 18:29:21,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 935 transitions. [2025-03-03 18:29:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 18:29:21,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:29:21,626 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -185087453, now seen corresponding path program 1 times [2025-03-03 18:29:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920735655] [2025-03-03 18:29:21,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:29:21,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:29:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920735655] [2025-03-03 18:29:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920735655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:21,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149205368] [2025-03-03 18:29:21,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:21,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:21,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:21,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:21,965 INFO L87 Difference]: Start difference. First operand 646 states and 935 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,364 INFO L93 Difference]: Finished difference Result 1241 states and 1812 transitions. [2025-03-03 18:29:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 18:29:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,366 INFO L225 Difference]: With dead ends: 1241 [2025-03-03 18:29:22,366 INFO L226 Difference]: Without dead ends: 651 [2025-03-03 18:29:22,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:22,367 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 45 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4038 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-03 18:29:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 647. [2025-03-03 18:29:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4489164086687307) internal successors, (936), 646 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 936 transitions. [2025-03-03 18:29:22,373 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 936 transitions. Word has length 68 [2025-03-03 18:29:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,373 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 936 transitions. [2025-03-03 18:29:22,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 936 transitions. [2025-03-03 18:29:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 18:29:22,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:29:22,374 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1515510439, now seen corresponding path program 1 times [2025-03-03 18:29:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915588469] [2025-03-03 18:29:22,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 18:29:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 18:29:22,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915588469] [2025-03-03 18:29:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915588469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:29:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484770773] [2025-03-03 18:29:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:22,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:22,953 INFO L87 Difference]: Start difference. First operand 647 states and 936 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:23,839 INFO L93 Difference]: Finished difference Result 1246 states and 1816 transitions. [2025-03-03 18:29:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 18:29:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:23,842 INFO L225 Difference]: With dead ends: 1246 [2025-03-03 18:29:23,842 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 18:29:23,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:23,843 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 11 mSDsluCounter, 9744 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10401 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:23,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10401 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:29:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 18:29:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2025-03-03 18:29:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.4491392801251957) internal successors, (926), 639 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 926 transitions. [2025-03-03 18:29:23,848 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 926 transitions. Word has length 68 [2025-03-03 18:29:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:23,849 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 926 transitions. [2025-03-03 18:29:23,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 926 transitions. [2025-03-03 18:29:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 18:29:23,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:23,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:23,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:29:23,849 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:23,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 808269086, now seen corresponding path program 1 times [2025-03-03 18:29:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:23,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70013433] [2025-03-03 18:29:23,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:23,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 18:29:23,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 18:29:23,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:23,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70013433] [2025-03-03 18:29:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70013433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664713519] [2025-03-03 18:29:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:24,027 INFO L87 Difference]: Start difference. First operand 640 states and 926 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:24,377 INFO L93 Difference]: Finished difference Result 1237 states and 1807 transitions. [2025-03-03 18:29:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 18:29:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:24,379 INFO L225 Difference]: With dead ends: 1237 [2025-03-03 18:29:24,379 INFO L226 Difference]: Without dead ends: 666 [2025-03-03 18:29:24,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:24,380 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 11 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4023 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:24,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4023 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-03 18:29:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 658. [2025-03-03 18:29:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.4444444444444444) internal successors, (949), 657 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 949 transitions. [2025-03-03 18:29:24,386 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 949 transitions. Word has length 69 [2025-03-03 18:29:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:24,386 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 949 transitions. [2025-03-03 18:29:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 949 transitions. [2025-03-03 18:29:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 18:29:24,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:24,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:29:24,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -239379447, now seen corresponding path program 1 times [2025-03-03 18:29:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793146823] [2025-03-03 18:29:24,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:24,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 18:29:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 18:29:24,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793146823] [2025-03-03 18:29:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793146823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:24,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:24,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 18:29:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067328924] [2025-03-03 18:29:24,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:24,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:29:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:24,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:29:24,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:24,736 INFO L87 Difference]: Start difference. First operand 658 states and 949 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:25,540 INFO L93 Difference]: Finished difference Result 1309 states and 1903 transitions. [2025-03-03 18:29:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:29:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 18:29:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:25,542 INFO L225 Difference]: With dead ends: 1309 [2025-03-03 18:29:25,542 INFO L226 Difference]: Without dead ends: 700 [2025-03-03 18:29:25,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:25,543 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 19 mSDsluCounter, 9065 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9721 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:25,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 9721 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:29:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-03 18:29:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 696. [2025-03-03 18:29:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.4431654676258994) internal successors, (1003), 695 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1003 transitions. [2025-03-03 18:29:25,550 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1003 transitions. Word has length 69 [2025-03-03 18:29:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:25,550 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1003 transitions. [2025-03-03 18:29:25,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1003 transitions. [2025-03-03 18:29:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:25,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:25,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:25,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:29:25,550 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:25,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 287740136, now seen corresponding path program 1 times [2025-03-03 18:29:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378055177] [2025-03-03 18:29:25,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:25,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:25,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:25,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:25,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378055177] [2025-03-03 18:29:25,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378055177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:25,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:25,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719266456] [2025-03-03 18:29:25,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:25,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:25,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:25,729 INFO L87 Difference]: Start difference. First operand 696 states and 1003 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:26,022 INFO L93 Difference]: Finished difference Result 1326 states and 1934 transitions. [2025-03-03 18:29:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:26,024 INFO L225 Difference]: With dead ends: 1326 [2025-03-03 18:29:26,024 INFO L226 Difference]: Without dead ends: 714 [2025-03-03 18:29:26,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:26,025 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 11 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4004 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:26,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4004 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-03 18:29:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 710. [2025-03-03 18:29:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.4414668547249647) internal successors, (1022), 709 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1022 transitions. [2025-03-03 18:29:26,032 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1022 transitions. Word has length 70 [2025-03-03 18:29:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1022 transitions. [2025-03-03 18:29:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1022 transitions. [2025-03-03 18:29:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:26,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:26,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:26,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 18:29:26,032 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:26,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash 327421501, now seen corresponding path program 1 times [2025-03-03 18:29:26,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443602649] [2025-03-03 18:29:26,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:26,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:26,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:26,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:26,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:26,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443602649] [2025-03-03 18:29:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443602649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-03 18:29:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857201112] [2025-03-03 18:29:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 18:29:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:26,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 18:29:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=928, Unknown=0, NotChecked=0, Total=992 [2025-03-03 18:29:26,845 INFO L87 Difference]: Start difference. First operand 710 states and 1022 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:28,514 INFO L93 Difference]: Finished difference Result 1379 states and 2005 transitions. [2025-03-03 18:29:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 18:29:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:28,516 INFO L225 Difference]: With dead ends: 1379 [2025-03-03 18:29:28,516 INFO L226 Difference]: Without dead ends: 758 [2025-03-03 18:29:28,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:29:28,517 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 29 mSDsluCounter, 17601 mSDsCounter, 0 mSdLazyCounter, 5276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18233 SdHoareTripleChecker+Invalid, 5278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:28,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18233 Invalid, 5278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5276 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 18:29:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-03 18:29:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 750. [2025-03-03 18:29:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4379172229639519) internal successors, (1077), 749 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1077 transitions. [2025-03-03 18:29:28,526 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1077 transitions. Word has length 70 [2025-03-03 18:29:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1077 transitions. [2025-03-03 18:29:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1077 transitions. [2025-03-03 18:29:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:28,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:28,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 18:29:28,527 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash 538017251, now seen corresponding path program 1 times [2025-03-03 18:29:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002920061] [2025-03-03 18:29:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:28,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:28,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:28,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:28,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002920061] [2025-03-03 18:29:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002920061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:28,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:28,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:29:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238092807] [2025-03-03 18:29:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:28,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:28,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:28,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:28,933 INFO L87 Difference]: Start difference. First operand 750 states and 1077 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:29,588 INFO L93 Difference]: Finished difference Result 1814 states and 2653 transitions. [2025-03-03 18:29:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:29:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:29,591 INFO L225 Difference]: With dead ends: 1814 [2025-03-03 18:29:29,591 INFO L226 Difference]: Without dead ends: 1180 [2025-03-03 18:29:29,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:29,592 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 689 mSDsluCounter, 6285 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 6939 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:29,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 6939 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:29:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-03 18:29:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 745. [2025-03-03 18:29:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 1.4341397849462365) internal successors, (1067), 744 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1067 transitions. [2025-03-03 18:29:29,599 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1067 transitions. Word has length 70 [2025-03-03 18:29:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:29,600 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1067 transitions. [2025-03-03 18:29:29,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1067 transitions. [2025-03-03 18:29:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:29,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:29,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 18:29:29,600 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1313499472, now seen corresponding path program 1 times [2025-03-03 18:29:29,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:29,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344614235] [2025-03-03 18:29:29,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:29,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:29,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:29,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:29,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344614235] [2025-03-03 18:29:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344614235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81599681] [2025-03-03 18:29:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:29,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:29,821 INFO L87 Difference]: Start difference. First operand 745 states and 1067 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:30,184 INFO L93 Difference]: Finished difference Result 1807 states and 2634 transitions. [2025-03-03 18:29:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:30,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:30,187 INFO L225 Difference]: With dead ends: 1807 [2025-03-03 18:29:30,187 INFO L226 Difference]: Without dead ends: 1144 [2025-03-03 18:29:30,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:30,188 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 637 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 3957 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:30,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 3957 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-03 18:29:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 728. [2025-03-03 18:29:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4319119669876204) internal successors, (1041), 727 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1041 transitions. [2025-03-03 18:29:30,196 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1041 transitions. Word has length 70 [2025-03-03 18:29:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:30,196 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1041 transitions. [2025-03-03 18:29:30,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1041 transitions. [2025-03-03 18:29:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:30,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:30,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 18:29:30,197 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2072601949, now seen corresponding path program 1 times [2025-03-03 18:29:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35822688] [2025-03-03 18:29:30,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:30,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:30,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:30,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35822688] [2025-03-03 18:29:30,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35822688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-03 18:29:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44304857] [2025-03-03 18:29:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:30,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 18:29:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:30,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 18:29:30,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:29:30,817 INFO L87 Difference]: Start difference. First operand 728 states and 1041 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:32,027 INFO L93 Difference]: Finished difference Result 1369 states and 1983 transitions. [2025-03-03 18:29:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 18:29:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:32,029 INFO L225 Difference]: With dead ends: 1369 [2025-03-03 18:29:32,029 INFO L226 Difference]: Without dead ends: 728 [2025-03-03 18:29:32,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2025-03-03 18:29:32,031 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 14 mSDsluCounter, 14816 mSDsCounter, 0 mSdLazyCounter, 3988 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15463 SdHoareTripleChecker+Invalid, 3988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:32,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15463 Invalid, 3988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3988 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:29:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-03-03 18:29:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2025-03-03 18:29:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4305364511691885) internal successors, (1040), 727 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1040 transitions. [2025-03-03 18:29:32,036 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1040 transitions. Word has length 70 [2025-03-03 18:29:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1040 transitions. [2025-03-03 18:29:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1040 transitions. [2025-03-03 18:29:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 18:29:32,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:32,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:32,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 18:29:32,037 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:32,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1547960695, now seen corresponding path program 1 times [2025-03-03 18:29:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748878431] [2025-03-03 18:29:32,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 18:29:32,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 18:29:32,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:32,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:32,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748878431] [2025-03-03 18:29:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748878431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800379291] [2025-03-03 18:29:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:32,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:32,252 INFO L87 Difference]: Start difference. First operand 728 states and 1040 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:32,500 INFO L93 Difference]: Finished difference Result 1381 states and 1995 transitions. [2025-03-03 18:29:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:32,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 18:29:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:32,502 INFO L225 Difference]: With dead ends: 1381 [2025-03-03 18:29:32,502 INFO L226 Difference]: Without dead ends: 694 [2025-03-03 18:29:32,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:32,503 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 22 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:32,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2670 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-03 18:29:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-03 18:29:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.443001443001443) internal successors, (1000), 693 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1000 transitions. [2025-03-03 18:29:32,512 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1000 transitions. Word has length 70 [2025-03-03 18:29:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:32,512 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1000 transitions. [2025-03-03 18:29:32,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1000 transitions. [2025-03-03 18:29:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 18:29:32,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:32,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 18:29:32,513 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:32,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 331185677, now seen corresponding path program 1 times [2025-03-03 18:29:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653119494] [2025-03-03 18:29:32,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:32,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 18:29:32,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 18:29:32,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:32,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653119494] [2025-03-03 18:29:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653119494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-03 18:29:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908309190] [2025-03-03 18:29:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:33,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 18:29:33,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:33,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 18:29:33,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2025-03-03 18:29:33,273 INFO L87 Difference]: Start difference. First operand 694 states and 1000 transitions. Second operand has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:34,498 INFO L93 Difference]: Finished difference Result 1315 states and 1919 transitions. [2025-03-03 18:29:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 18:29:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 18:29:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:34,500 INFO L225 Difference]: With dead ends: 1315 [2025-03-03 18:29:34,500 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 18:29:34,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2025-03-03 18:29:34,501 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 11 mSDsluCounter, 15390 mSDsCounter, 0 mSdLazyCounter, 4235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16034 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:34,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 16034 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4235 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:29:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 18:29:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 18:29:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4439592430858808) internal successors, (992), 687 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 992 transitions. [2025-03-03 18:29:34,506 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 992 transitions. Word has length 71 [2025-03-03 18:29:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:34,506 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 992 transitions. [2025-03-03 18:29:34,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 992 transitions. [2025-03-03 18:29:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 18:29:34,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:34,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:34,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 18:29:34,507 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -886153447, now seen corresponding path program 1 times [2025-03-03 18:29:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471323358] [2025-03-03 18:29:34,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:34,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 18:29:34,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 18:29:34,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:34,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471323358] [2025-03-03 18:29:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471323358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2025-03-03 18:29:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664118231] [2025-03-03 18:29:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 18:29:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:35,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 18:29:35,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2025-03-03 18:29:35,301 INFO L87 Difference]: Start difference. First operand 688 states and 992 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:36,919 INFO L93 Difference]: Finished difference Result 1310 states and 1912 transitions. [2025-03-03 18:29:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 18:29:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 18:29:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:36,921 INFO L225 Difference]: With dead ends: 1310 [2025-03-03 18:29:36,921 INFO L226 Difference]: Without dead ends: 689 [2025-03-03 18:29:36,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=927, Unknown=0, NotChecked=0, Total=992 [2025-03-03 18:29:36,922 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 12 mSDsluCounter, 17839 mSDsCounter, 0 mSdLazyCounter, 5027 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18479 SdHoareTripleChecker+Invalid, 5027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:36,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18479 Invalid, 5027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5027 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 18:29:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-03 18:29:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 688. [2025-03-03 18:29:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4425036390101893) internal successors, (991), 687 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 991 transitions. [2025-03-03 18:29:36,929 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 991 transitions. Word has length 71 [2025-03-03 18:29:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 991 transitions. [2025-03-03 18:29:36,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 991 transitions. [2025-03-03 18:29:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 18:29:36,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:36,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 18:29:36,930 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1649748662, now seen corresponding path program 1 times [2025-03-03 18:29:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400229738] [2025-03-03 18:29:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 18:29:36,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 18:29:36,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400229738] [2025-03-03 18:29:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400229738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-03 18:29:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037730967] [2025-03-03 18:29:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 18:29:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:37,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 18:29:37,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2025-03-03 18:29:37,753 INFO L87 Difference]: Start difference. First operand 688 states and 991 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:39,050 INFO L93 Difference]: Finished difference Result 1309 states and 1910 transitions. [2025-03-03 18:29:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 18:29:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 18:29:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:39,052 INFO L225 Difference]: With dead ends: 1309 [2025-03-03 18:29:39,052 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 18:29:39,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2025-03-03 18:29:39,053 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 8 mSDsluCounter, 16616 mSDsCounter, 0 mSdLazyCounter, 4630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17258 SdHoareTripleChecker+Invalid, 4630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17258 Invalid, 4630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4630 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:29:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 18:29:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 18:29:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4410480349344978) internal successors, (990), 687 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 990 transitions. [2025-03-03 18:29:39,057 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 990 transitions. Word has length 71 [2025-03-03 18:29:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:39,058 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 990 transitions. [2025-03-03 18:29:39,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 29 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 990 transitions. [2025-03-03 18:29:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 18:29:39,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:39,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 18:29:39,059 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash -283467543, now seen corresponding path program 1 times [2025-03-03 18:29:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174288136] [2025-03-03 18:29:39,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:39,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 18:29:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 18:29:39,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:39,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174288136] [2025-03-03 18:29:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174288136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:40,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:40,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:40,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197048480] [2025-03-03 18:29:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:40,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:40,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:40,043 INFO L87 Difference]: Start difference. First operand 688 states and 990 transitions. Second operand has 8 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:40,654 INFO L93 Difference]: Finished difference Result 1850 states and 2708 transitions. [2025-03-03 18:29:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:40,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-03-03 18:29:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:40,657 INFO L225 Difference]: With dead ends: 1850 [2025-03-03 18:29:40,657 INFO L226 Difference]: Without dead ends: 1229 [2025-03-03 18:29:40,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:40,658 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 704 mSDsluCounter, 6501 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 7677 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:40,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 7677 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:29:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-03-03 18:29:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 811. [2025-03-03 18:29:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.4419753086419753) internal successors, (1168), 810 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1168 transitions. [2025-03-03 18:29:40,667 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1168 transitions. Word has length 339 [2025-03-03 18:29:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:40,667 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1168 transitions. [2025-03-03 18:29:40,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1168 transitions. [2025-03-03 18:29:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 18:29:40,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:40,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 18:29:40,669 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:40,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash 458529838, now seen corresponding path program 1 times [2025-03-03 18:29:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021434711] [2025-03-03 18:29:40,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:40,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 18:29:41,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 18:29:41,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:41,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021434711] [2025-03-03 18:29:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021434711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243147368] [2025-03-03 18:29:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:42,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:42,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:42,055 INFO L87 Difference]: Start difference. First operand 811 states and 1168 transitions. Second operand has 10 states, 10 states have (on average 33.9) internal successors, (339), 10 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:42,582 INFO L93 Difference]: Finished difference Result 1984 states and 2906 transitions. [2025-03-03 18:29:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:42,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 33.9) internal successors, (339), 10 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-03-03 18:29:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:42,585 INFO L225 Difference]: With dead ends: 1984 [2025-03-03 18:29:42,585 INFO L226 Difference]: Without dead ends: 1240 [2025-03-03 18:29:42,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:42,586 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 648 mSDsluCounter, 5246 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 5904 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:42,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 5904 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-03-03 18:29:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 891. [2025-03-03 18:29:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.4438202247191012) internal successors, (1285), 890 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1285 transitions. [2025-03-03 18:29:42,595 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1285 transitions. Word has length 339 [2025-03-03 18:29:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:42,595 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1285 transitions. [2025-03-03 18:29:42,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.9) internal successors, (339), 10 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1285 transitions. [2025-03-03 18:29:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 18:29:42,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:42,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:42,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 18:29:42,597 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:42,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash -64700184, now seen corresponding path program 1 times [2025-03-03 18:29:42,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:42,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774235750] [2025-03-03 18:29:42,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:42,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:42,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 18:29:43,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 18:29:43,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:43,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 18:29:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774235750] [2025-03-03 18:29:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774235750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:44,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:44,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624911046] [2025-03-03 18:29:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:44,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:44,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:44,025 INFO L87 Difference]: Start difference. First operand 891 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:44,241 INFO L93 Difference]: Finished difference Result 1642 states and 2393 transitions. [2025-03-03 18:29:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:44,241 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-03-03 18:29:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:44,243 INFO L225 Difference]: With dead ends: 1642 [2025-03-03 18:29:44,243 INFO L226 Difference]: Without dead ends: 898 [2025-03-03 18:29:44,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:44,244 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 534 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:44,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1990 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-03 18:29:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 895. [2025-03-03 18:29:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.441834451901566) internal successors, (1289), 894 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1289 transitions. [2025-03-03 18:29:44,250 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1289 transitions. Word has length 340 [2025-03-03 18:29:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1289 transitions. [2025-03-03 18:29:44,251 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1289 transitions. [2025-03-03 18:29:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 18:29:44,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:44,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 18:29:44,253 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -115466540, now seen corresponding path program 1 times [2025-03-03 18:29:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432583532] [2025-03-03 18:29:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:44,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 18:29:45,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 18:29:45,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:45,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:46,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432583532] [2025-03-03 18:29:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432583532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652855611] [2025-03-03 18:29:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:46,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:46,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:46,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:46,338 INFO L87 Difference]: Start difference. First operand 895 states and 1289 transitions. Second operand has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:46,757 INFO L93 Difference]: Finished difference Result 2180 states and 3195 transitions. [2025-03-03 18:29:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:46,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2025-03-03 18:29:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:46,760 INFO L225 Difference]: With dead ends: 2180 [2025-03-03 18:29:46,760 INFO L226 Difference]: Without dead ends: 1432 [2025-03-03 18:29:46,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:46,761 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 728 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 4580 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:46,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 4580 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-03-03 18:29:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1209. [2025-03-03 18:29:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.455298013245033) internal successors, (1758), 1208 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1758 transitions. [2025-03-03 18:29:46,770 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1758 transitions. Word has length 341 [2025-03-03 18:29:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:46,770 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1758 transitions. [2025-03-03 18:29:46,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1758 transitions. [2025-03-03 18:29:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 18:29:46,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:46,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 18:29:46,772 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -559491162, now seen corresponding path program 1 times [2025-03-03 18:29:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571040896] [2025-03-03 18:29:46,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 18:29:46,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 18:29:46,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:46,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:47,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571040896] [2025-03-03 18:29:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571040896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:47,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:47,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909677703] [2025-03-03 18:29:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:47,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:47,177 INFO L87 Difference]: Start difference. First operand 1209 states and 1758 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:47,638 INFO L93 Difference]: Finished difference Result 2671 states and 3911 transitions. [2025-03-03 18:29:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-03-03 18:29:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:47,640 INFO L225 Difference]: With dead ends: 2671 [2025-03-03 18:29:47,640 INFO L226 Difference]: Without dead ends: 1213 [2025-03-03 18:29:47,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:47,642 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 644 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:47,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 5110 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-03 18:29:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1211. [2025-03-03 18:29:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1210 states have (on average 1.4545454545454546) internal successors, (1760), 1210 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1760 transitions. [2025-03-03 18:29:47,650 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1760 transitions. Word has length 342 [2025-03-03 18:29:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:47,651 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1760 transitions. [2025-03-03 18:29:47,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1760 transitions. [2025-03-03 18:29:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 18:29:47,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:47,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 18:29:47,653 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:47,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -13425474, now seen corresponding path program 1 times [2025-03-03 18:29:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119952775] [2025-03-03 18:29:47,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:47,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 18:29:48,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 18:29:48,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:48,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119952775] [2025-03-03 18:29:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119952775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:48,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642360423] [2025-03-03 18:29:48,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:48,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:48,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:48,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:48,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:48,970 INFO L87 Difference]: Start difference. First operand 1211 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:49,231 INFO L93 Difference]: Finished difference Result 2142 states and 3132 transitions. [2025-03-03 18:29:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-03-03 18:29:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:49,233 INFO L225 Difference]: With dead ends: 2142 [2025-03-03 18:29:49,233 INFO L226 Difference]: Without dead ends: 1392 [2025-03-03 18:29:49,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:49,234 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 603 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:49,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2724 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-03 18:29:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2025-03-03 18:29:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.4578833693304536) internal successors, (2025), 1389 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2025 transitions. [2025-03-03 18:29:49,243 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2025 transitions. Word has length 342 [2025-03-03 18:29:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:49,243 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2025 transitions. [2025-03-03 18:29:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.0) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2025 transitions. [2025-03-03 18:29:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-03 18:29:49,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:49,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:49,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 18:29:49,245 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:49,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 955597664, now seen corresponding path program 1 times [2025-03-03 18:29:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:49,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37169637] [2025-03-03 18:29:49,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:49,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-03 18:29:50,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-03 18:29:50,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:50,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37169637] [2025-03-03 18:29:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37169637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:29:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164003745] [2025-03-03 18:29:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:50,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:50,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:50,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:50,806 INFO L87 Difference]: Start difference. First operand 1390 states and 2025 transitions. Second operand has 11 states, 11 states have (on average 31.181818181818183) internal successors, (343), 11 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:51,183 INFO L93 Difference]: Finished difference Result 2519 states and 3691 transitions. [2025-03-03 18:29:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:51,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 31.181818181818183) internal successors, (343), 11 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-03-03 18:29:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:51,186 INFO L225 Difference]: With dead ends: 2519 [2025-03-03 18:29:51,186 INFO L226 Difference]: Without dead ends: 1502 [2025-03-03 18:29:51,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:51,187 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 71 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5397 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:51,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5397 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-03-03 18:29:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1464. [2025-03-03 18:29:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.456596035543404) internal successors, (2131), 1463 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2131 transitions. [2025-03-03 18:29:51,201 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2131 transitions. Word has length 343 [2025-03-03 18:29:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:51,201 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 2131 transitions. [2025-03-03 18:29:51,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.181818181818183) internal successors, (343), 11 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2131 transitions. [2025-03-03 18:29:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-03 18:29:51,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:51,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 18:29:51,203 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -511809085, now seen corresponding path program 1 times [2025-03-03 18:29:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102512684] [2025-03-03 18:29:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:51,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-03 18:29:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-03 18:29:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:52,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:52,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102512684] [2025-03-03 18:29:52,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102512684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:52,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:52,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:52,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840569228] [2025-03-03 18:29:52,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:52,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:52,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:52,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:52,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:52,406 INFO L87 Difference]: Start difference. First operand 1464 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:52,618 INFO L93 Difference]: Finished difference Result 2426 states and 3546 transitions. [2025-03-03 18:29:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:52,619 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-03-03 18:29:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:52,621 INFO L225 Difference]: With dead ends: 2426 [2025-03-03 18:29:52,621 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 18:29:52,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:52,622 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 360 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:52,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1990 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 18:29:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2025-03-03 18:29:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.455228981544771) internal successors, (2129), 1463 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2129 transitions. [2025-03-03 18:29:52,633 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2129 transitions. Word has length 343 [2025-03-03 18:29:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:52,635 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 2129 transitions. [2025-03-03 18:29:52,635 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2129 transitions. [2025-03-03 18:29:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 18:29:52,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:52,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:52,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 18:29:52,638 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:52,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1239259193, now seen corresponding path program 1 times [2025-03-03 18:29:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015401783] [2025-03-03 18:29:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:52,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 18:29:52,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 18:29:52,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:52,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015401783] [2025-03-03 18:29:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015401783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:53,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:53,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446243452] [2025-03-03 18:29:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:53,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:53,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:53,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:53,026 INFO L87 Difference]: Start difference. First operand 1464 states and 2129 transitions. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:53,208 INFO L93 Difference]: Finished difference Result 2655 states and 3884 transitions. [2025-03-03 18:29:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-03-03 18:29:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:53,211 INFO L225 Difference]: With dead ends: 2655 [2025-03-03 18:29:53,211 INFO L226 Difference]: Without dead ends: 1564 [2025-03-03 18:29:53,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:53,212 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 48 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:53,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2686 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2025-03-03 18:29:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2025-03-03 18:29:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.4568138195777351) internal successors, (2277), 1563 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2277 transitions. [2025-03-03 18:29:53,221 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2277 transitions. Word has length 344 [2025-03-03 18:29:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:53,221 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2277 transitions. [2025-03-03 18:29:53,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2277 transitions. [2025-03-03 18:29:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 18:29:53,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:53,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 18:29:53,224 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:53,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1267960756, now seen corresponding path program 1 times [2025-03-03 18:29:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133095119] [2025-03-03 18:29:53,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:53,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 18:29:53,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 18:29:53,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:53,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133095119] [2025-03-03 18:29:53,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133095119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:53,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:53,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752599275] [2025-03-03 18:29:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:53,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:53,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:53,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:53,592 INFO L87 Difference]: Start difference. First operand 1564 states and 2277 transitions. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:53,740 INFO L93 Difference]: Finished difference Result 2678 states and 3915 transitions. [2025-03-03 18:29:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-03-03 18:29:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:53,742 INFO L225 Difference]: With dead ends: 2678 [2025-03-03 18:29:53,742 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 18:29:53,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:53,743 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 0 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:53,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2018 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 18:29:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 18:29:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.45448758752387) internal successors, (2285), 1571 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2285 transitions. [2025-03-03 18:29:53,754 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2285 transitions. Word has length 344 [2025-03-03 18:29:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:53,754 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2285 transitions. [2025-03-03 18:29:53,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:53,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2285 transitions. [2025-03-03 18:29:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-03 18:29:53,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:53,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 18:29:53,756 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 621838822, now seen corresponding path program 1 times [2025-03-03 18:29:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:53,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585668025] [2025-03-03 18:29:53,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:53,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-03 18:29:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-03 18:29:54,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:54,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585668025] [2025-03-03 18:29:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585668025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465719427] [2025-03-03 18:29:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:55,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:55,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:55,106 INFO L87 Difference]: Start difference. First operand 1572 states and 2285 transitions. Second operand has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:55,459 INFO L93 Difference]: Finished difference Result 3016 states and 4411 transitions. [2025-03-03 18:29:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-03-03 18:29:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:55,462 INFO L225 Difference]: With dead ends: 3016 [2025-03-03 18:29:55,462 INFO L226 Difference]: Without dead ends: 1628 [2025-03-03 18:29:55,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:55,464 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 499 mSDsluCounter, 3601 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4266 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:55,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4266 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-03 18:29:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1622. [2025-03-03 18:29:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 1.4528069093152376) internal successors, (2355), 1621 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2355 transitions. [2025-03-03 18:29:55,475 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2355 transitions. Word has length 344 [2025-03-03 18:29:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:55,476 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2355 transitions. [2025-03-03 18:29:55,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2355 transitions. [2025-03-03 18:29:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 18:29:55,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:55,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 18:29:55,479 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:55,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:55,479 INFO L85 PathProgramCache]: Analyzing trace with hash -169392935, now seen corresponding path program 1 times [2025-03-03 18:29:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47938611] [2025-03-03 18:29:55,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:55,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 18:29:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 18:29:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47938611] [2025-03-03 18:29:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47938611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:57,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:57,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:29:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865339777] [2025-03-03 18:29:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:57,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:29:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:57,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:29:57,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:29:57,672 INFO L87 Difference]: Start difference. First operand 1622 states and 2355 transitions. Second operand has 15 states, 15 states have (on average 23.0) internal successors, (345), 15 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:58,375 INFO L93 Difference]: Finished difference Result 2650 states and 3864 transitions. [2025-03-03 18:29:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:29:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 23.0) internal successors, (345), 15 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2025-03-03 18:29:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:58,378 INFO L225 Difference]: With dead ends: 2650 [2025-03-03 18:29:58,378 INFO L226 Difference]: Without dead ends: 1684 [2025-03-03 18:29:58,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:29:58,379 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 28 mSDsluCounter, 8592 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9259 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:58,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9259 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:29:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-03 18:29:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1678. [2025-03-03 18:29:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1677 states have (on average 1.450805008944544) internal successors, (2433), 1677 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2433 transitions. [2025-03-03 18:29:58,389 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2433 transitions. Word has length 345 [2025-03-03 18:29:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2433 transitions. [2025-03-03 18:29:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 23.0) internal successors, (345), 15 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2433 transitions. [2025-03-03 18:29:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 18:29:58,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:58,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:58,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 18:29:58,392 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 896249595, now seen corresponding path program 1 times [2025-03-03 18:29:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449433381] [2025-03-03 18:29:58,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 18:29:58,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 18:29:58,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:58,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449433381] [2025-03-03 18:29:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449433381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:59,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:29:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667719444] [2025-03-03 18:29:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:59,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:59,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:59,863 INFO L87 Difference]: Start difference. First operand 1678 states and 2433 transitions. Second operand has 13 states, 13 states have (on average 26.615384615384617) internal successors, (346), 13 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:00,888 INFO L93 Difference]: Finished difference Result 3614 states and 5264 transitions. [2025-03-03 18:30:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:30:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 26.615384615384617) internal successors, (346), 13 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-03 18:30:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:00,892 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 18:30:00,892 INFO L226 Difference]: Without dead ends: 2592 [2025-03-03 18:30:00,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:30:00,893 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 755 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 13683 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:00,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 13683 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:30:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2025-03-03 18:30:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1726. [2025-03-03 18:30:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.4521739130434783) internal successors, (2505), 1725 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2505 transitions. [2025-03-03 18:30:00,906 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2505 transitions. Word has length 346 [2025-03-03 18:30:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:00,906 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2505 transitions. [2025-03-03 18:30:00,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.615384615384617) internal successors, (346), 13 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2505 transitions. [2025-03-03 18:30:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 18:30:00,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:00,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:00,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 18:30:00,909 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1981369733, now seen corresponding path program 1 times [2025-03-03 18:30:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924641413] [2025-03-03 18:30:00,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:00,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 18:30:01,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 18:30:01,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:01,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924641413] [2025-03-03 18:30:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924641413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:01,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:01,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:30:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227591745] [2025-03-03 18:30:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:30:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:30:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:30:01,294 INFO L87 Difference]: Start difference. First operand 1726 states and 2505 transitions. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:01,479 INFO L93 Difference]: Finished difference Result 3144 states and 4587 transitions. [2025-03-03 18:30:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:30:01,479 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-03 18:30:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:01,482 INFO L225 Difference]: With dead ends: 3144 [2025-03-03 18:30:01,482 INFO L226 Difference]: Without dead ends: 2074 [2025-03-03 18:30:01,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:30:01,483 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 119 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:01,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2683 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-03-03 18:30:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2025-03-03 18:30:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.4563434635793535) internal successors, (3019), 2073 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3019 transitions. [2025-03-03 18:30:01,499 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3019 transitions. Word has length 346 [2025-03-03 18:30:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:01,499 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3019 transitions. [2025-03-03 18:30:01,499 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3019 transitions. [2025-03-03 18:30:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 18:30:01,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:01,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:01,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 18:30:01,502 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1790387936, now seen corresponding path program 1 times [2025-03-03 18:30:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106532541] [2025-03-03 18:30:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:01,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 18:30:02,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 18:30:02,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:02,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:03,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106532541] [2025-03-03 18:30:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106532541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:30:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384518275] [2025-03-03 18:30:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:30:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:30:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:03,159 INFO L87 Difference]: Start difference. First operand 2074 states and 3019 transitions. Second operand has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:03,571 INFO L93 Difference]: Finished difference Result 5085 states and 7454 transitions. [2025-03-03 18:30:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:03,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-03-03 18:30:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:03,575 INFO L225 Difference]: With dead ends: 5085 [2025-03-03 18:30:03,575 INFO L226 Difference]: Without dead ends: 3801 [2025-03-03 18:30:03,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:03,577 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 940 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 4490 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:03,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 4490 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2025-03-03 18:30:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3202. [2025-03-03 18:30:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 3201 states have (on average 1.4629803186504218) internal successors, (4683), 3201 states have internal predecessors, (4683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 4683 transitions. [2025-03-03 18:30:03,601 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 4683 transitions. Word has length 346 [2025-03-03 18:30:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:03,601 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 4683 transitions. [2025-03-03 18:30:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 4683 transitions. [2025-03-03 18:30:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 18:30:03,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:03,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:03,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 18:30:03,605 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:03,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1839245827, now seen corresponding path program 1 times [2025-03-03 18:30:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827090506] [2025-03-03 18:30:03,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 18:30:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 18:30:04,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827090506] [2025-03-03 18:30:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827090506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:30:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048805914] [2025-03-03 18:30:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:30:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:04,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:30:04,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:04,578 INFO L87 Difference]: Start difference. First operand 3202 states and 4683 transitions. Second operand has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 9 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:04,941 INFO L93 Difference]: Finished difference Result 6133 states and 8997 transitions. [2025-03-03 18:30:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 9 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-03-03 18:30:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:04,944 INFO L225 Difference]: With dead ends: 6133 [2025-03-03 18:30:04,944 INFO L226 Difference]: Without dead ends: 3250 [2025-03-03 18:30:04,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:30:04,946 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 10 mSDsluCounter, 4632 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:04,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5297 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2025-03-03 18:30:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2025-03-03 18:30:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 1.4616805170821792) internal successors, (4749), 3249 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4749 transitions. [2025-03-03 18:30:04,970 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4749 transitions. Word has length 347 [2025-03-03 18:30:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:04,971 INFO L471 AbstractCegarLoop]: Abstraction has 3250 states and 4749 transitions. [2025-03-03 18:30:04,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 9 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4749 transitions. [2025-03-03 18:30:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 18:30:04,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:04,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 18:30:04,975 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2119518816, now seen corresponding path program 1 times [2025-03-03 18:30:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482937436] [2025-03-03 18:30:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 18:30:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 18:30:05,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:05,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 18:30:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:06,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482937436] [2025-03-03 18:30:06,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482937436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:06,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:06,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:30:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233119807] [2025-03-03 18:30:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:06,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:30:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:06,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:30:06,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:06,893 INFO L87 Difference]: Start difference. First operand 3250 states and 4749 transitions. Second operand has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:07,301 INFO L93 Difference]: Finished difference Result 4576 states and 6691 transitions. [2025-03-03 18:30:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:30:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-03-03 18:30:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:07,304 INFO L225 Difference]: With dead ends: 4576 [2025-03-03 18:30:07,304 INFO L226 Difference]: Without dead ends: 3276 [2025-03-03 18:30:07,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:30:07,306 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1278 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:07,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3449 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-03-03 18:30:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3262. [2025-03-03 18:30:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3261 states have (on average 1.4575283655320455) internal successors, (4753), 3261 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4753 transitions. [2025-03-03 18:30:07,328 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4753 transitions. Word has length 347 [2025-03-03 18:30:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:07,328 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4753 transitions. [2025-03-03 18:30:07,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.375) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4753 transitions. [2025-03-03 18:30:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 18:30:07,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:07,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 18:30:07,332 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -195051031, now seen corresponding path program 1 times [2025-03-03 18:30:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304192745] [2025-03-03 18:30:07,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:07,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 18:30:08,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 18:30:08,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:08,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304192745] [2025-03-03 18:30:09,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304192745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:09,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:09,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:30:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650228480] [2025-03-03 18:30:09,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:09,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:30:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:30:09,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:09,165 INFO L87 Difference]: Start difference. First operand 3262 states and 4753 transitions. Second operand has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:09,909 INFO L93 Difference]: Finished difference Result 9447 states and 13838 transitions. [2025-03-03 18:30:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:30:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-03-03 18:30:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:09,915 INFO L225 Difference]: With dead ends: 9447 [2025-03-03 18:30:09,915 INFO L226 Difference]: Without dead ends: 6684 [2025-03-03 18:30:09,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:30:09,918 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2064 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 7601 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:09,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 7601 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:30:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6684 states. [2025-03-03 18:30:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6684 to 3726. [2025-03-03 18:30:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 3725 states have (on average 1.4563758389261745) internal successors, (5425), 3725 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 5425 transitions. [2025-03-03 18:30:09,951 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 5425 transitions. Word has length 348 [2025-03-03 18:30:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:09,952 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 5425 transitions. [2025-03-03 18:30:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.0) internal successors, (348), 12 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 5425 transitions. [2025-03-03 18:30:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 18:30:09,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:09,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 18:30:09,956 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -125500060, now seen corresponding path program 1 times [2025-03-03 18:30:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058533800] [2025-03-03 18:30:09,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:09,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 18:30:10,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 18:30:10,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:10,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:10,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058533800] [2025-03-03 18:30:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058533800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:10,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:30:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230428273] [2025-03-03 18:30:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:10,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:30:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:10,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:30:10,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:30:10,353 INFO L87 Difference]: Start difference. First operand 3726 states and 5425 transitions. Second operand has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:10,576 INFO L93 Difference]: Finished difference Result 6848 states and 10001 transitions. [2025-03-03 18:30:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:30:10,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-03-03 18:30:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:10,580 INFO L225 Difference]: With dead ends: 6848 [2025-03-03 18:30:10,580 INFO L226 Difference]: Without dead ends: 3756 [2025-03-03 18:30:10,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:30:10,583 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 4 mSDsluCounter, 2673 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:10,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3345 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2025-03-03 18:30:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3756. [2025-03-03 18:30:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3756 states, 3755 states have (on average 1.455392809587217) internal successors, (5465), 3755 states have internal predecessors, (5465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3756 states to 3756 states and 5465 transitions. [2025-03-03 18:30:10,608 INFO L78 Accepts]: Start accepts. Automaton has 3756 states and 5465 transitions. Word has length 348 [2025-03-03 18:30:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:10,608 INFO L471 AbstractCegarLoop]: Abstraction has 3756 states and 5465 transitions. [2025-03-03 18:30:10,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.0) internal successors, (348), 6 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3756 states and 5465 transitions. [2025-03-03 18:30:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 18:30:10,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:10,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 18:30:10,613 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1552845003, now seen corresponding path program 1 times [2025-03-03 18:30:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737726727] [2025-03-03 18:30:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 18:30:11,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 18:30:11,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:11,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737726727] [2025-03-03 18:30:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737726727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:13,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 18:30:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047655671] [2025-03-03 18:30:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:13,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:30:13,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:13,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:30:13,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:30:13,526 INFO L87 Difference]: Start difference. First operand 3756 states and 5465 transitions. Second operand has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:15,134 INFO L93 Difference]: Finished difference Result 5929 states and 8632 transitions. [2025-03-03 18:30:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:30:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-03 18:30:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:15,138 INFO L225 Difference]: With dead ends: 5929 [2025-03-03 18:30:15,138 INFO L226 Difference]: Without dead ends: 4611 [2025-03-03 18:30:15,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:15,140 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 746 mSDsluCounter, 12406 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 13589 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 13589 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:30:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2025-03-03 18:30:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 3780. [2025-03-03 18:30:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3779 states have (on average 1.4543530034400636) internal successors, (5496), 3779 states have internal predecessors, (5496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5496 transitions. [2025-03-03 18:30:15,167 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5496 transitions. Word has length 349 [2025-03-03 18:30:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:15,167 INFO L471 AbstractCegarLoop]: Abstraction has 3780 states and 5496 transitions. [2025-03-03 18:30:15,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5496 transitions. [2025-03-03 18:30:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 18:30:15,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:15,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:15,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 18:30:15,171 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2090184677, now seen corresponding path program 1 times [2025-03-03 18:30:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671176070] [2025-03-03 18:30:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:15,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 18:30:16,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 18:30:16,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:16,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 18:30:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:17,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671176070] [2025-03-03 18:30:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671176070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:30:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532074693] [2025-03-03 18:30:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:30:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:17,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:30:17,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:17,022 INFO L87 Difference]: Start difference. First operand 3780 states and 5496 transitions. Second operand has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:17,280 INFO L93 Difference]: Finished difference Result 5137 states and 7466 transitions. [2025-03-03 18:30:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:30:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-03 18:30:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:17,283 INFO L225 Difference]: With dead ends: 5137 [2025-03-03 18:30:17,284 INFO L226 Difference]: Without dead ends: 3795 [2025-03-03 18:30:17,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:17,285 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 11 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:17,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3330 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2025-03-03 18:30:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3788. [2025-03-03 18:30:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3787 states have (on average 1.4528650646950092) internal successors, (5502), 3787 states have internal predecessors, (5502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5502 transitions. [2025-03-03 18:30:17,309 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5502 transitions. Word has length 349 [2025-03-03 18:30:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:17,309 INFO L471 AbstractCegarLoop]: Abstraction has 3788 states and 5502 transitions. [2025-03-03 18:30:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5502 transitions. [2025-03-03 18:30:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-03 18:30:17,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:17,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 18:30:17,313 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:17,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 192757365, now seen corresponding path program 1 times [2025-03-03 18:30:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614118176] [2025-03-03 18:30:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 18:30:18,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 18:30:18,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:18,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614118176] [2025-03-03 18:30:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614118176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094951410] [2025-03-03 18:30:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:18,593 INFO L87 Difference]: Start difference. First operand 3788 states and 5502 transitions. Second operand has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:19,346 INFO L93 Difference]: Finished difference Result 6184 states and 8987 transitions. [2025-03-03 18:30:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:30:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-03-03 18:30:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:19,350 INFO L225 Difference]: With dead ends: 6184 [2025-03-03 18:30:19,351 INFO L226 Difference]: Without dead ends: 4834 [2025-03-03 18:30:19,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:19,353 INFO L435 NwaCegarLoop]: 1234 mSDtfsCounter, 727 mSDsluCounter, 9262 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 10496 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:19,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 10496 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:30:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-03-03 18:30:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 3903. [2025-03-03 18:30:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3902 states have (on average 1.451050743208611) internal successors, (5662), 3902 states have internal predecessors, (5662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 5662 transitions. [2025-03-03 18:30:19,382 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 5662 transitions. Word has length 350 [2025-03-03 18:30:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:19,382 INFO L471 AbstractCegarLoop]: Abstraction has 3903 states and 5662 transitions. [2025-03-03 18:30:19,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 5662 transitions. [2025-03-03 18:30:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-03 18:30:19,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:19,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:19,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 18:30:19,386 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:19,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1481247737, now seen corresponding path program 1 times [2025-03-03 18:30:19,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:19,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226272410] [2025-03-03 18:30:19,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:19,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 18:30:20,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 18:30:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:20,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226272410] [2025-03-03 18:30:20,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226272410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:20,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:20,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:30:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419302314] [2025-03-03 18:30:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:30:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:20,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:30:20,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:20,885 INFO L87 Difference]: Start difference. First operand 3903 states and 5662 transitions. Second operand has 8 states, 8 states have (on average 43.75) internal successors, (350), 8 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)