./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 799588e54c3039b2c8c519a723f8c91c1a6dd7c6903655309c138fca54077fbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:18:42,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:18:42,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:18:42,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:18:42,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:18:42,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:18:42,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:18:42,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:18:42,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:18:42,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:18:42,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:18:42,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:18:42,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:18:42,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:18:42,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:18:42,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:18:42,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:42,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:42,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:42,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:18:42,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:18:42,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 799588e54c3039b2c8c519a723f8c91c1a6dd7c6903655309c138fca54077fbe [2025-01-09 08:18:42,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:18:43,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:18:43,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:18:43,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:18:43,009 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:18:43,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c [2025-01-09 08:18:44,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b529d56c9/1d120f574ef94850ade9c3cbde02cbbd/FLAGf0bcb9988 [2025-01-09 08:18:44,567 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:18:44,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c [2025-01-09 08:18:44,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b529d56c9/1d120f574ef94850ade9c3cbde02cbbd/FLAGf0bcb9988 [2025-01-09 08:18:44,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b529d56c9/1d120f574ef94850ade9c3cbde02cbbd [2025-01-09 08:18:44,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:18:44,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:18:44,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:44,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:18:44,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:18:44,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:44" (1/1) ... [2025-01-09 08:18:44,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd38cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:44, skipping insertion in model container [2025-01-09 08:18:44,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:44" (1/1) ... [2025-01-09 08:18:44,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:18:45,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c[1259,1272] [2025-01-09 08:18:45,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:45,260 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:18:45,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p5.c[1259,1272] [2025-01-09 08:18:45,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:45,376 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:18:45,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45 WrapperNode [2025-01-09 08:18:45,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:45,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:45,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:18:45,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:18:45,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,582 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2119 [2025-01-09 08:18:45,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:45,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:18:45,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:18:45,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:18:45,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:18:45,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:18:45,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:18:45,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:18:45,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:18:45,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (1/1) ... [2025-01-09 08:18:45,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:45,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:45,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:18:45,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:18:45,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:18:45,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:18:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:18:45,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:18:46,160 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:18:46,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:18:48,101 INFO L? ?]: Removed 1281 outVars from TransFormulas that were not future-live. [2025-01-09 08:18:48,102 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:18:48,116 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:18:48,117 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:18:48,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:48 BoogieIcfgContainer [2025-01-09 08:18:48,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:18:48,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:18:48,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:18:48,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:18:48,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:18:44" (1/3) ... [2025-01-09 08:18:48,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11724a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:48, skipping insertion in model container [2025-01-09 08:18:48,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:45" (2/3) ... [2025-01-09 08:18:48,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11724a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:48, skipping insertion in model container [2025-01-09 08:18:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:48" (3/3) ... [2025-01-09 08:18:48,129 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p5.c [2025-01-09 08:18:48,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:18:48,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p5.c that has 1 procedures, 648 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:18:48,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:18:48,190 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;@5b1ee73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:18:48,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:18:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 648 states, 646 states have (on average 1.5) internal successors, (969), 647 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 08:18:48,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:48,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:48,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -725709712, now seen corresponding path program 1 times [2025-01-09 08:18:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96957319] [2025-01-09 08:18:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:48,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 08:18:48,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 08:18:48,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:48,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96957319] [2025-01-09 08:18:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96957319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:48,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204041616] [2025-01-09 08:18:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:48,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:48,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:48,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:48,726 INFO L87 Difference]: Start difference. First operand has 648 states, 646 states have (on average 1.5) internal successors, (969), 647 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:48,803 INFO L93 Difference]: Finished difference Result 1241 states and 1859 transitions. [2025-01-09 08:18:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:48,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 08:18:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:48,821 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 08:18:48,821 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 08:18:48,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:48,826 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:48,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2883 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 08:18:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2025-01-09 08:18:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4969040247678018) internal successors, (967), 646 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 967 transitions. [2025-01-09 08:18:48,886 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 967 transitions. Word has length 51 [2025-01-09 08:18:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:48,890 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 967 transitions. [2025-01-09 08:18:48,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 967 transitions. [2025-01-09 08:18:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 08:18:48,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:48,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:48,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:18:48,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1020469140, now seen corresponding path program 1 times [2025-01-09 08:18:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122215049] [2025-01-09 08:18:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:48,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 08:18:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 08:18:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122215049] [2025-01-09 08:18:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122215049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622639480] [2025-01-09 08:18:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:49,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:49,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:49,045 INFO L87 Difference]: Start difference. First operand 647 states and 967 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:49,081 INFO L93 Difference]: Finished difference Result 1242 states and 1857 transitions. [2025-01-09 08:18:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 08:18:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:49,083 INFO L225 Difference]: With dead ends: 1242 [2025-01-09 08:18:49,083 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 08:18:49,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:49,084 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:49,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2879 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 08:18:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-01-09 08:18:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4953703703703705) internal successors, (969), 648 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 969 transitions. [2025-01-09 08:18:49,096 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 969 transitions. Word has length 52 [2025-01-09 08:18:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 969 transitions. [2025-01-09 08:18:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 969 transitions. [2025-01-09 08:18:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 08:18:49,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:49,097 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-01-09 08:18:49,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:18:49,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:49,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1627229385, now seen corresponding path program 1 times [2025-01-09 08:18:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621780381] [2025-01-09 08:18:49,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 08:18:49,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 08:18:49,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:49,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621780381] [2025-01-09 08:18:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621780381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:18:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642178384] [2025-01-09 08:18:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:49,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:18:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:49,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:18:49,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:18:49,455 INFO L87 Difference]: Start difference. First operand 649 states and 969 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-01-09 08:18:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:49,630 INFO L93 Difference]: Finished difference Result 1464 states and 2184 transitions. [2025-01-09 08:18:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:18:49,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-01-09 08:18:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:49,634 INFO L225 Difference]: With dead ends: 1464 [2025-01-09 08:18:49,635 INFO L226 Difference]: Without dead ends: 869 [2025-01-09 08:18:49,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:18:49,638 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 368 mSDsluCounter, 5600 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 6547 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:49,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 6547 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-01-09 08:18:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 678. [2025-01-09 08:18:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.4933530280649927) internal successors, (1011), 677 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1011 transitions. [2025-01-09 08:18:49,659 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1011 transitions. Word has length 53 [2025-01-09 08:18:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:49,660 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1011 transitions. [2025-01-09 08:18:49,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-01-09 08:18:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1011 transitions. [2025-01-09 08:18:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 08:18:49,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:49,665 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-01-09 08:18:49,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:18:49,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash -186609517, now seen corresponding path program 1 times [2025-01-09 08:18:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:49,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790418528] [2025-01-09 08:18:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:49,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 08:18:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 08:18:49,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:49,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790418528] [2025-01-09 08:18:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790418528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:50,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:18:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505718845] [2025-01-09 08:18:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:18:50,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:50,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:18:50,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:50,033 INFO L87 Difference]: Start difference. First operand 678 states and 1011 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-01-09 08:18:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:50,275 INFO L93 Difference]: Finished difference Result 1466 states and 2185 transitions. [2025-01-09 08:18:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:18:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-01-09 08:18:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:50,282 INFO L225 Difference]: With dead ends: 1466 [2025-01-09 08:18:50,282 INFO L226 Difference]: Without dead ends: 871 [2025-01-09 08:18:50,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:18:50,287 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 369 mSDsluCounter, 7479 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 8425 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-01-09 08:18:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 681. [2025-01-09 08:18:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.4926470588235294) internal successors, (1015), 680 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1015 transitions. [2025-01-09 08:18:50,313 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1015 transitions. Word has length 54 [2025-01-09 08:18:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:50,313 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1015 transitions. [2025-01-09 08:18:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-01-09 08:18:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1015 transitions. [2025-01-09 08:18:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 08:18:50,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:50,318 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-01-09 08:18:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:18:50,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:50,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2028091489, now seen corresponding path program 1 times [2025-01-09 08:18:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624665121] [2025-01-09 08:18:50,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 08:18:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 08:18:50,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:50,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:50,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624665121] [2025-01-09 08:18:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624665121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:50,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:18:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147271232] [2025-01-09 08:18:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:50,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:50,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:50,553 INFO L87 Difference]: Start difference. First operand 681 states and 1015 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-01-09 08:18:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:50,715 INFO L93 Difference]: Finished difference Result 1483 states and 2208 transitions. [2025-01-09 08:18:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:50,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-01-09 08:18:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:50,719 INFO L225 Difference]: With dead ends: 1483 [2025-01-09 08:18:50,719 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 08:18:50,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:50,722 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 359 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 5620 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:50,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 5620 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 08:18:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 682. [2025-01-09 08:18:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4904552129221733) internal successors, (1015), 681 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1015 transitions. [2025-01-09 08:18:50,740 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1015 transitions. Word has length 54 [2025-01-09 08:18:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1015 transitions. [2025-01-09 08:18:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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-01-09 08:18:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1015 transitions. [2025-01-09 08:18:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 08:18:50,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:50,742 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-01-09 08:18:50,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:18:50,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:50,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1170581146, now seen corresponding path program 1 times [2025-01-09 08:18:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414869415] [2025-01-09 08:18:50,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:50,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 08:18:50,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 08:18:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:51,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414869415] [2025-01-09 08:18:51,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414869415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:51,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:51,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:18:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470573717] [2025-01-09 08:18:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:51,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:18:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:51,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:18:51,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:18:51,285 INFO L87 Difference]: Start difference. First operand 682 states and 1015 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 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-01-09 08:18:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:51,525 INFO L93 Difference]: Finished difference Result 1471 states and 2190 transitions. [2025-01-09 08:18:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:18:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 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-01-09 08:18:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:51,529 INFO L225 Difference]: With dead ends: 1471 [2025-01-09 08:18:51,529 INFO L226 Difference]: Without dead ends: 876 [2025-01-09 08:18:51,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:18:51,530 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 371 mSDsluCounter, 7453 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 8395 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 8395 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-01-09 08:18:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 686. [2025-01-09 08:18:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.489051094890511) internal successors, (1020), 685 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1020 transitions. [2025-01-09 08:18:51,542 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1020 transitions. Word has length 55 [2025-01-09 08:18:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1020 transitions. [2025-01-09 08:18:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 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-01-09 08:18:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1020 transitions. [2025-01-09 08:18:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 08:18:51,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:51,543 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-01-09 08:18:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:18:51,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 709035362, now seen corresponding path program 1 times [2025-01-09 08:18:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:51,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65398966] [2025-01-09 08:18:51,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 08:18:51,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 08:18:51,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65398966] [2025-01-09 08:18:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65398966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:18:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421886844] [2025-01-09 08:18:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:51,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:18:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:51,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:18:51,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:51,646 INFO L87 Difference]: Start difference. First operand 686 states and 1020 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-01-09 08:18:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:51,735 INFO L93 Difference]: Finished difference Result 1778 states and 2648 transitions. [2025-01-09 08:18:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:51,735 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-01-09 08:18:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:51,738 INFO L225 Difference]: With dead ends: 1778 [2025-01-09 08:18:51,739 INFO L226 Difference]: Without dead ends: 1166 [2025-01-09 08:18:51,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-01-09 08:18:51,740 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 804 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:51,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 3740 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-01-09 08:18:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 682. [2025-01-09 08:18:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4889867841409692) internal successors, (1014), 681 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1014 transitions. [2025-01-09 08:18:51,752 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1014 transitions. Word has length 55 [2025-01-09 08:18:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:51,752 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1014 transitions. [2025-01-09 08:18:51,752 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-01-09 08:18:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1014 transitions. [2025-01-09 08:18:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 08:18:51,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:51,752 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-01-09 08:18:51,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:18:51,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -363731758, now seen corresponding path program 1 times [2025-01-09 08:18:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361048792] [2025-01-09 08:18:51,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 08:18:51,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 08:18:51,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:51,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361048792] [2025-01-09 08:18:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361048792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:52,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:18:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512226302] [2025-01-09 08:18:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:52,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:18:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:52,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:18:52,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:52,030 INFO L87 Difference]: Start difference. First operand 682 states and 1014 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-01-09 08:18:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:52,073 INFO L93 Difference]: Finished difference Result 1287 states and 1917 transitions. [2025-01-09 08:18:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:18:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-01-09 08:18:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:52,076 INFO L225 Difference]: With dead ends: 1287 [2025-01-09 08:18:52,076 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 08:18:52,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:52,077 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 927 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:52,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2874 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 08:18:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-01-09 08:18:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4861717612809315) internal successors, (1021), 687 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1021 transitions. [2025-01-09 08:18:52,089 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1021 transitions. Word has length 56 [2025-01-09 08:18:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:52,089 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1021 transitions. [2025-01-09 08:18:52,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-01-09 08:18:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1021 transitions. [2025-01-09 08:18:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 08:18:52,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:52,090 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-01-09 08:18:52,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:18:52,090 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:52,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1723962207, now seen corresponding path program 1 times [2025-01-09 08:18:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:52,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557375242] [2025-01-09 08:18:52,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:52,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 08:18:52,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 08:18:52,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557375242] [2025-01-09 08:18:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557375242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:18:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803936131] [2025-01-09 08:18:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:52,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:18:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:52,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:18:52,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:52,284 INFO L87 Difference]: Start difference. First operand 688 states and 1021 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-01-09 08:18:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:52,351 INFO L93 Difference]: Finished difference Result 1413 states and 2101 transitions. [2025-01-09 08:18:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:52,351 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-01-09 08:18:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:52,354 INFO L225 Difference]: With dead ends: 1413 [2025-01-09 08:18:52,354 INFO L226 Difference]: Without dead ends: 804 [2025-01-09 08:18:52,355 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-01-09 08:18:52,355 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 259 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:52,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 3715 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-01-09 08:18:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 679. [2025-01-09 08:18:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.4867256637168142) internal successors, (1008), 678 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1008 transitions. [2025-01-09 08:18:52,367 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1008 transitions. Word has length 57 [2025-01-09 08:18:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:52,367 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1008 transitions. [2025-01-09 08:18:52,368 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-01-09 08:18:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1008 transitions. [2025-01-09 08:18:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 08:18:52,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:52,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:18:52,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 459090266, now seen corresponding path program 1 times [2025-01-09 08:18:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707759560] [2025-01-09 08:18:52,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:52,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 08:18:53,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 08:18:53,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:53,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707759560] [2025-01-09 08:18:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707759560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:18:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796090929] [2025-01-09 08:18:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:54,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:54,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:54,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:54,995 INFO L87 Difference]: Start difference. First operand 679 states and 1008 transitions. Second operand has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 7 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-01-09 08:18:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:55,084 INFO L93 Difference]: Finished difference Result 1755 states and 2617 transitions. [2025-01-09 08:18:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 7 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-01-09 08:18:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:55,088 INFO L225 Difference]: With dead ends: 1755 [2025-01-09 08:18:55,088 INFO L226 Difference]: Without dead ends: 1157 [2025-01-09 08:18:55,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-01-09 08:18:55,089 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 790 mSDsluCounter, 3746 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 4700 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:55,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 4700 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-01-09 08:18:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 696. [2025-01-09 08:18:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.4820143884892085) internal successors, (1030), 695 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1030 transitions. [2025-01-09 08:18:55,102 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1030 transitions. Word has length 349 [2025-01-09 08:18:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:55,102 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1030 transitions. [2025-01-09 08:18:55,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 7 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-01-09 08:18:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1030 transitions. [2025-01-09 08:18:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 08:18:55,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:55,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:55,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:18:55,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1118476680, now seen corresponding path program 1 times [2025-01-09 08:18:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404439909] [2025-01-09 08:18:55,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:55,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 08:18:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 08:18:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:55,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404439909] [2025-01-09 08:18:56,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404439909] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:18:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754347763] [2025-01-09 08:18:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:56,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:18:56,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:18:56,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 08:18:57,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 08:18:57,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:57,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 08:18:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:18:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:58,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:18:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754347763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:58,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:18:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-09 08:18:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076013076] [2025-01-09 08:18:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:58,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:58,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:18:58,137 INFO L87 Difference]: Start difference. First operand 696 states and 1030 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 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-01-09 08:18:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:58,214 INFO L93 Difference]: Finished difference Result 2247 states and 3353 transitions. [2025-01-09 08:18:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 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-01-09 08:18:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:58,220 INFO L225 Difference]: With dead ends: 2247 [2025-01-09 08:18:58,220 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 08:18:58,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:18:58,221 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 1632 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:58,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 5271 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 08:18:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1188. [2025-01-09 08:18:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 1.4877843302443134) internal successors, (1766), 1187 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1766 transitions. [2025-01-09 08:18:58,247 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1766 transitions. Word has length 350 [2025-01-09 08:18:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1766 transitions. [2025-01-09 08:18:58,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 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-01-09 08:18:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1766 transitions. [2025-01-09 08:18:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 08:18:58,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:58,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:58,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:18:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 08:18:58,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1430469103, now seen corresponding path program 1 times [2025-01-09 08:18:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:58,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313729689] [2025-01-09 08:18:58,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:58,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 08:18:58,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 08:18:58,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:59,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:59,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313729689] [2025-01-09 08:18:59,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313729689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:59,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:18:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929849510] [2025-01-09 08:18:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:59,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:18:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:59,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:18:59,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:59,281 INFO L87 Difference]: Start difference. First operand 1188 states and 1766 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:59,333 INFO L93 Difference]: Finished difference Result 2561 states and 3820 transitions. [2025-01-09 08:18:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:59,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2025-01-09 08:18:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:59,338 INFO L225 Difference]: With dead ends: 2561 [2025-01-09 08:18:59,338 INFO L226 Difference]: Without dead ends: 1469 [2025-01-09 08:18:59,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:59,340 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 310 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:59,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 3735 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-01-09 08:18:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1177. [2025-01-09 08:18:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.4880952380952381) internal successors, (1750), 1176 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1750 transitions. [2025-01-09 08:18:59,358 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1750 transitions. Word has length 351 [2025-01-09 08:18:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1750 transitions. [2025-01-09 08:18:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1750 transitions. [2025-01-09 08:18:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 08:18:59,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:59,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:59,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:18:59,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:59,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 560722142, now seen corresponding path program 1 times [2025-01-09 08:18:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259155997] [2025-01-09 08:18:59,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:59,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 08:18:59,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 08:18:59,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:59,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259155997] [2025-01-09 08:19:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259155997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351839848] [2025-01-09 08:19:00,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:00,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:19:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 08:19:01,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 08:19:01,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:01,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:01,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 08:19:01,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:02,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351839848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:02,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:02,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 16 [2025-01-09 08:19:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67937085] [2025-01-09 08:19:02,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:02,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:19:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:02,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:19:02,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:19:02,590 INFO L87 Difference]: Start difference. First operand 1177 states and 1750 transitions. Second operand has 11 states, 11 states have (on average 31.90909090909091) internal successors, (351), 11 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:02,810 INFO L93 Difference]: Finished difference Result 3474 states and 5191 transitions. [2025-01-09 08:19:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:19:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 31.90909090909091) internal successors, (351), 11 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2025-01-09 08:19:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:02,816 INFO L225 Difference]: With dead ends: 3474 [2025-01-09 08:19:02,817 INFO L226 Difference]: Without dead ends: 1937 [2025-01-09 08:19:02,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:19:02,820 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 988 mSDsluCounter, 8105 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 9047 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:02,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 9047 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2025-01-09 08:19:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1654. [2025-01-09 08:19:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4906231094978826) internal successors, (2464), 1653 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2464 transitions. [2025-01-09 08:19:02,852 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2464 transitions. Word has length 351 [2025-01-09 08:19:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:02,852 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2464 transitions. [2025-01-09 08:19:02,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.90909090909091) internal successors, (351), 11 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2464 transitions. [2025-01-09 08:19:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-09 08:19:02,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:02,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:02,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:03,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:03,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:03,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash -912530353, now seen corresponding path program 1 times [2025-01-09 08:19:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368081476] [2025-01-09 08:19:03,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:03,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-09 08:19:03,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-09 08:19:03,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:03,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368081476] [2025-01-09 08:19:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368081476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:03,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:03,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423484321] [2025-01-09 08:19:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:03,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:03,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:03,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:03,659 INFO L87 Difference]: Start difference. First operand 1654 states and 2464 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:03,715 INFO L93 Difference]: Finished difference Result 2879 states and 4296 transitions. [2025-01-09 08:19:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2025-01-09 08:19:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:03,719 INFO L225 Difference]: With dead ends: 2879 [2025-01-09 08:19:03,719 INFO L226 Difference]: Without dead ends: 1338 [2025-01-09 08:19:03,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:03,722 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 298 mSDsluCounter, 3729 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:03,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 4684 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-01-09 08:19:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1197. [2025-01-09 08:19:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1196 states have (on average 1.4849498327759196) internal successors, (1776), 1196 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1776 transitions. [2025-01-09 08:19:03,737 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1776 transitions. Word has length 351 [2025-01-09 08:19:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:03,738 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1776 transitions. [2025-01-09 08:19:03,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1776 transitions. [2025-01-09 08:19:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 08:19:03,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:03,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:03,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:19:03,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:03,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -490388496, now seen corresponding path program 1 times [2025-01-09 08:19:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065850343] [2025-01-09 08:19:03,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:03,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:03,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 08:19:04,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 08:19:04,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:04,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065850343] [2025-01-09 08:19:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065850343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:04,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393151538] [2025-01-09 08:19:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:04,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:04,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:04,614 INFO L87 Difference]: Start difference. First operand 1197 states and 1776 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:04,647 INFO L93 Difference]: Finished difference Result 2286 states and 3405 transitions. [2025-01-09 08:19:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2025-01-09 08:19:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:04,652 INFO L225 Difference]: With dead ends: 2286 [2025-01-09 08:19:04,652 INFO L226 Difference]: Without dead ends: 1205 [2025-01-09 08:19:04,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 08:19:04,654 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 6 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:04,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3831 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:04,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-01-09 08:19:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1203. [2025-01-09 08:19:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1202 states have (on average 1.4841930116472546) internal successors, (1784), 1202 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1784 transitions. [2025-01-09 08:19:04,670 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1784 transitions. Word has length 352 [2025-01-09 08:19:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:04,671 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1784 transitions. [2025-01-09 08:19:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 5 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1784 transitions. [2025-01-09 08:19:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 08:19:04,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:04,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:04,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:19:04,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 235273646, now seen corresponding path program 1 times [2025-01-09 08:19:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608882906] [2025-01-09 08:19:04,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 08:19:05,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 08:19:05,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:05,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608882906] [2025-01-09 08:19:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608882906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:19:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763904036] [2025-01-09 08:19:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:19:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:19:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:05,772 INFO L87 Difference]: Start difference. First operand 1203 states and 1784 transitions. Second operand has 8 states, 8 states have (on average 44.125) internal successors, (353), 8 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:05,854 INFO L93 Difference]: Finished difference Result 2387 states and 3554 transitions. [2025-01-09 08:19:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:19:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.125) internal successors, (353), 8 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2025-01-09 08:19:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:05,858 INFO L225 Difference]: With dead ends: 2387 [2025-01-09 08:19:05,858 INFO L226 Difference]: Without dead ends: 1300 [2025-01-09 08:19:05,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:19:05,859 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 230 mSDsluCounter, 5621 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 6572 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:05,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 6572 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-01-09 08:19:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1272. [2025-01-09 08:19:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.4838709677419355) internal successors, (1886), 1271 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1886 transitions. [2025-01-09 08:19:05,876 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1886 transitions. Word has length 353 [2025-01-09 08:19:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1886 transitions. [2025-01-09 08:19:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.125) internal successors, (353), 8 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1886 transitions. [2025-01-09 08:19:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-09 08:19:05,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:05,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:19:05,879 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1279187095, now seen corresponding path program 1 times [2025-01-09 08:19:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418819752] [2025-01-09 08:19:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:05,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-09 08:19:06,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-09 08:19:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418819752] [2025-01-09 08:19:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418819752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109543959] [2025-01-09 08:19:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:06,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:06,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:06,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:06,977 INFO L87 Difference]: Start difference. First operand 1272 states and 1886 transitions. Second operand has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:07,019 INFO L93 Difference]: Finished difference Result 2429 states and 3615 transitions. [2025-01-09 08:19:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:19:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-01-09 08:19:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:07,022 INFO L225 Difference]: With dead ends: 2429 [2025-01-09 08:19:07,022 INFO L226 Difference]: Without dead ends: 1342 [2025-01-09 08:19:07,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:07,025 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 60 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4019 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:07,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4019 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-01-09 08:19:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1290. [2025-01-09 08:19:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 1.4817688130333593) internal successors, (1910), 1289 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1910 transitions. [2025-01-09 08:19:07,040 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1910 transitions. Word has length 354 [2025-01-09 08:19:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:07,040 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1910 transitions. [2025-01-09 08:19:07,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1910 transitions. [2025-01-09 08:19:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 08:19:07,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:07,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:07,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:19:07,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash -4508299, now seen corresponding path program 1 times [2025-01-09 08:19:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518636330] [2025-01-09 08:19:07,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:07,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 08:19:07,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 08:19:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518636330] [2025-01-09 08:19:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518636330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505246247] [2025-01-09 08:19:08,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:08,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:08,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:19:08,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 08:19:08,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 08:19:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:08,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:08,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 08:19:08,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:09,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505246247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-09 08:19:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464981769] [2025-01-09 08:19:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:09,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:09,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:09,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:19:09,084 INFO L87 Difference]: Start difference. First operand 1290 states and 1910 transitions. Second operand has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:09,152 INFO L93 Difference]: Finished difference Result 2675 states and 3979 transitions. [2025-01-09 08:19:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2025-01-09 08:19:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:09,160 INFO L225 Difference]: With dead ends: 2675 [2025-01-09 08:19:09,160 INFO L226 Difference]: Without dead ends: 1570 [2025-01-09 08:19:09,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:19:09,162 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 215 mSDsluCounter, 3944 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 4903 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:09,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 4903 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-01-09 08:19:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1460. [2025-01-09 08:19:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.4818368745716244) internal successors, (2162), 1459 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2162 transitions. [2025-01-09 08:19:09,193 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2162 transitions. Word has length 355 [2025-01-09 08:19:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:09,193 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2162 transitions. [2025-01-09 08:19:09,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.714285714285715) internal successors, (355), 7 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2162 transitions. [2025-01-09 08:19:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-09 08:19:09,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:09,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:09,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:09,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 388643959, now seen corresponding path program 1 times [2025-01-09 08:19:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634438934] [2025-01-09 08:19:09,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:09,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 08:19:09,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 08:19:09,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634438934] [2025-01-09 08:19:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634438934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495275693] [2025-01-09 08:19:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:10,423 INFO L87 Difference]: Start difference. First operand 1460 states and 2162 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:10,455 INFO L93 Difference]: Finished difference Result 2927 states and 4351 transitions. [2025-01-09 08:19:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:10,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-01-09 08:19:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:10,459 INFO L225 Difference]: With dead ends: 2927 [2025-01-09 08:19:10,460 INFO L226 Difference]: Without dead ends: 1652 [2025-01-09 08:19:10,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 08:19:10,461 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 94 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 3831 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-01-09 08:19:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1648. [2025-01-09 08:19:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.482695810564663) internal successors, (2442), 1647 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2442 transitions. [2025-01-09 08:19:10,478 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2442 transitions. Word has length 356 [2025-01-09 08:19:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:10,479 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2442 transitions. [2025-01-09 08:19:10,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2442 transitions. [2025-01-09 08:19:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 08:19:10,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:10,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:10,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:19:10,481 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:10,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1386343176, now seen corresponding path program 1 times [2025-01-09 08:19:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:10,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061319627] [2025-01-09 08:19:10,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:10,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 08:19:10,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 08:19:10,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:10,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061319627] [2025-01-09 08:19:11,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061319627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824438994] [2025-01-09 08:19:11,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:11,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:11,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:11,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 08:19:11,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-09 08:19:12,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 08:19:12,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:12,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 2087 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-01-09 08:19:12,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 08:19:18,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824438994] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:28,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:19:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [8, 39] total 71 [2025-01-09 08:19:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585829502] [2025-01-09 08:19:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 08:19:28,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:28,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 08:19:28,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=3935, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 08:19:28,615 INFO L87 Difference]: Start difference. First operand 1648 states and 2442 transitions. Second operand has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:33,414 INFO L93 Difference]: Finished difference Result 5085 states and 7568 transitions. [2025-01-09 08:19:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 08:19:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2025-01-09 08:19:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:33,430 INFO L225 Difference]: With dead ends: 5085 [2025-01-09 08:19:33,430 INFO L226 Difference]: Without dead ends: 3622 [2025-01-09 08:19:33,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 08:19:33,434 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 11145 mSDsluCounter, 21559 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11145 SdHoareTripleChecker+Valid, 22603 SdHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:33,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11145 Valid, 22603 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 08:19:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-01-09 08:19:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3043. [2025-01-09 08:19:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3042 states have (on average 1.4871794871794872) internal successors, (4524), 3042 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4524 transitions. [2025-01-09 08:19:33,468 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4524 transitions. Word has length 357 [2025-01-09 08:19:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 4524 transitions. [2025-01-09 08:19:33,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4524 transitions. [2025-01-09 08:19:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-09 08:19:33,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:33,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:33,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:33,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:33,676 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1537579904, now seen corresponding path program 1 times [2025-01-09 08:19:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2991620] [2025-01-09 08:19:33,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:33,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 08:19:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 08:19:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:34,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2991620] [2025-01-09 08:19:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2991620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648378716] [2025-01-09 08:19:34,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:34,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:34,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 08:19:35,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-09 08:19:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-09 08:19:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:35,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 2088 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 08:19:35,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:35,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:36,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648378716] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:36,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:36,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-09 08:19:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221323185] [2025-01-09 08:19:36,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:36,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:19:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:19:36,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:19:36,442 INFO L87 Difference]: Start difference. First operand 3043 states and 4524 transitions. Second operand has 14 states, 14 states have (on average 32.57142857142857) internal successors, (456), 14 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:36,751 INFO L93 Difference]: Finished difference Result 8680 states and 12932 transitions. [2025-01-09 08:19:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:19:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 32.57142857142857) internal successors, (456), 14 states have internal predecessors, (456), 0 states have call successors, (0), 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 358 [2025-01-09 08:19:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:36,757 INFO L225 Difference]: With dead ends: 8680 [2025-01-09 08:19:36,757 INFO L226 Difference]: Without dead ends: 3117 [2025-01-09 08:19:36,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 709 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:19:36,762 INFO L435 NwaCegarLoop]: 1074 mSDtfsCounter, 792 mSDsluCounter, 11247 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 12321 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:36,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 12321 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:19:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2025-01-09 08:19:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3107. [2025-01-09 08:19:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3106 states have (on average 1.48486799742434) internal successors, (4612), 3106 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 4612 transitions. [2025-01-09 08:19:36,805 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 4612 transitions. Word has length 358 [2025-01-09 08:19:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:36,805 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 4612 transitions. [2025-01-09 08:19:36,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 32.57142857142857) internal successors, (456), 14 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 4612 transitions. [2025-01-09 08:19:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 08:19:36,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:36,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:36,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 08:19:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:37,013 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1267825548, now seen corresponding path program 1 times [2025-01-09 08:19:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231123281] [2025-01-09 08:19:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 08:19:37,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 08:19:37,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:37,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231123281] [2025-01-09 08:19:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231123281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:19:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181392883] [2025-01-09 08:19:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:38,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:19:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:38,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:19:38,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:38,675 INFO L87 Difference]: Start difference. First operand 3107 states and 4612 transitions. Second operand has 9 states, 9 states have (on average 39.888888888888886) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:38,767 INFO L93 Difference]: Finished difference Result 6468 states and 9617 transitions. [2025-01-09 08:19:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:19:38,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.888888888888886) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2025-01-09 08:19:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:38,777 INFO L225 Difference]: With dead ends: 6468 [2025-01-09 08:19:38,778 INFO L226 Difference]: Without dead ends: 3655 [2025-01-09 08:19:38,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:38,782 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 106 mSDsluCounter, 5746 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 6694 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:38,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 6694 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2025-01-09 08:19:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3463. [2025-01-09 08:19:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3462 states have (on average 1.483535528596187) internal successors, (5136), 3462 states have internal predecessors, (5136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5136 transitions. [2025-01-09 08:19:38,818 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5136 transitions. Word has length 359 [2025-01-09 08:19:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:38,818 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 5136 transitions. [2025-01-09 08:19:38,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.888888888888886) internal successors, (359), 9 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5136 transitions. [2025-01-09 08:19:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-09 08:19:38,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:38,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:38,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:19:38,822 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:38,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1366518244, now seen corresponding path program 1 times [2025-01-09 08:19:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:38,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274060300] [2025-01-09 08:19:38,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 08:19:39,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 08:19:39,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274060300] [2025-01-09 08:19:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274060300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:40,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:19:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999248656] [2025-01-09 08:19:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:19:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:19:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:40,014 INFO L87 Difference]: Start difference. First operand 3463 states and 5136 transitions. Second operand has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:40,104 INFO L93 Difference]: Finished difference Result 8000 states and 11893 transitions. [2025-01-09 08:19:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2025-01-09 08:19:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:40,113 INFO L225 Difference]: With dead ends: 8000 [2025-01-09 08:19:40,113 INFO L226 Difference]: Without dead ends: 4831 [2025-01-09 08:19:40,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:19:40,118 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 2760 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 3819 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:40,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 3819 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2025-01-09 08:19:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4761. [2025-01-09 08:19:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4760 states have (on average 1.4857142857142858) internal successors, (7072), 4760 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 7072 transitions. [2025-01-09 08:19:40,177 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 7072 transitions. Word has length 360 [2025-01-09 08:19:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:40,177 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 7072 transitions. [2025-01-09 08:19:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 7072 transitions. [2025-01-09 08:19:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-09 08:19:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:40,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 08:19:40,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:40,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1300275343, now seen corresponding path program 1 times [2025-01-09 08:19:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068495968] [2025-01-09 08:19:40,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-09 08:19:40,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-09 08:19:40,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:40,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068495968] [2025-01-09 08:19:41,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068495968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:41,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:41,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987637394] [2025-01-09 08:19:41,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:41,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:41,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:41,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:41,450 INFO L87 Difference]: Start difference. First operand 4761 states and 7072 transitions. Second operand has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:41,511 INFO L93 Difference]: Finished difference Result 14752 states and 21975 transitions. [2025-01-09 08:19:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2025-01-09 08:19:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:41,532 INFO L225 Difference]: With dead ends: 14752 [2025-01-09 08:19:41,532 INFO L226 Difference]: Without dead ends: 11529 [2025-01-09 08:19:41,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:41,539 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 734 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 5220 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:41,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 5220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11529 states. [2025-01-09 08:19:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11529 to 8163. [2025-01-09 08:19:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 8162 states have (on average 1.4876255819652047) internal successors, (12142), 8162 states have internal predecessors, (12142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 12142 transitions. [2025-01-09 08:19:41,672 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 12142 transitions. Word has length 360 [2025-01-09 08:19:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:41,673 INFO L471 AbstractCegarLoop]: Abstraction has 8163 states and 12142 transitions. [2025-01-09 08:19:41,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 12142 transitions. [2025-01-09 08:19:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-09 08:19:41,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:41,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:41,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 08:19:41,678 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:41,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -630163846, now seen corresponding path program 1 times [2025-01-09 08:19:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274020782] [2025-01-09 08:19:41,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:41,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-01-09 08:19:42,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-01-09 08:19:42,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:42,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274020782] [2025-01-09 08:19:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274020782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322485488] [2025-01-09 08:19:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:42,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:42,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:42,819 INFO L87 Difference]: Start difference. First operand 8163 states and 12142 transitions. Second operand has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:42,912 INFO L93 Difference]: Finished difference Result 21126 states and 31465 transitions. [2025-01-09 08:19:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-01-09 08:19:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:42,930 INFO L225 Difference]: With dead ends: 21126 [2025-01-09 08:19:42,930 INFO L226 Difference]: Without dead ends: 14187 [2025-01-09 08:19:42,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-01-09 08:19:42,939 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 312 mSDsluCounter, 3812 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:42,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 4767 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14187 states. [2025-01-09 08:19:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14187 to 9867. [2025-01-09 08:19:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9867 states, 9866 states have (on average 1.482465031421042) internal successors, (14626), 9866 states have internal predecessors, (14626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 14626 transitions. [2025-01-09 08:19:43,037 INFO L78 Accepts]: Start accepts. Automaton has 9867 states and 14626 transitions. Word has length 361 [2025-01-09 08:19:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:43,037 INFO L471 AbstractCegarLoop]: Abstraction has 9867 states and 14626 transitions. [2025-01-09 08:19:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 14626 transitions. [2025-01-09 08:19:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 08:19:43,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:43,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:43,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:19:43,043 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:43,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -34368817, now seen corresponding path program 1 times [2025-01-09 08:19:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:43,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064793681] [2025-01-09 08:19:43,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:43,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:43,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 08:19:43,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 08:19:43,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:43,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064793681] [2025-01-09 08:19:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064793681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:44,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:19:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102384224] [2025-01-09 08:19:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:19:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:44,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:19:44,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:44,208 INFO L87 Difference]: Start difference. First operand 9867 states and 14626 transitions. Second operand has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:44,311 INFO L93 Difference]: Finished difference Result 16726 states and 24809 transitions. [2025-01-09 08:19:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:19:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-01-09 08:19:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:44,321 INFO L225 Difference]: With dead ends: 16726 [2025-01-09 08:19:44,321 INFO L226 Difference]: Without dead ends: 9939 [2025-01-09 08:19:44,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:44,329 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 857 mSDsluCounter, 4708 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:44,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 5652 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2025-01-09 08:19:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9903. [2025-01-09 08:19:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9903 states, 9902 states have (on average 1.4819228438699252) internal successors, (14674), 9902 states have internal predecessors, (14674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9903 states to 9903 states and 14674 transitions. [2025-01-09 08:19:44,417 INFO L78 Accepts]: Start accepts. Automaton has 9903 states and 14674 transitions. Word has length 362 [2025-01-09 08:19:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:44,417 INFO L471 AbstractCegarLoop]: Abstraction has 9903 states and 14674 transitions. [2025-01-09 08:19:44,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 9903 states and 14674 transitions. [2025-01-09 08:19:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 08:19:44,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:44,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:44,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 08:19:44,424 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:44,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1681610871, now seen corresponding path program 1 times [2025-01-09 08:19:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:44,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022523410] [2025-01-09 08:19:44,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 08:19:44,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 08:19:44,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:44,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022523410] [2025-01-09 08:19:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022523410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155023560] [2025-01-09 08:19:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:44,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:44,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:44,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:44,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:44,864 INFO L87 Difference]: Start difference. First operand 9903 states and 14674 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:44,909 INFO L93 Difference]: Finished difference Result 17218 states and 25525 transitions. [2025-01-09 08:19:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-01-09 08:19:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:44,918 INFO L225 Difference]: With dead ends: 17218 [2025-01-09 08:19:44,918 INFO L226 Difference]: Without dead ends: 9999 [2025-01-09 08:19:44,925 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-01-09 08:19:44,925 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 3 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:44,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3836 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2025-01-09 08:19:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 9999. [2025-01-09 08:19:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9999 states, 9998 states have (on average 1.4796959391878375) internal successors, (14794), 9998 states have internal predecessors, (14794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9999 states to 9999 states and 14794 transitions. [2025-01-09 08:19:45,000 INFO L78 Accepts]: Start accepts. Automaton has 9999 states and 14794 transitions. Word has length 362 [2025-01-09 08:19:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:45,001 INFO L471 AbstractCegarLoop]: Abstraction has 9999 states and 14794 transitions. [2025-01-09 08:19:45,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 9999 states and 14794 transitions. [2025-01-09 08:19:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 08:19:45,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:45,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:45,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 08:19:45,006 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 258191948, now seen corresponding path program 1 times [2025-01-09 08:19:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799359365] [2025-01-09 08:19:45,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:45,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 08:19:45,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 08:19:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799359365] [2025-01-09 08:19:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799359365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028506465] [2025-01-09 08:19:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:45,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:45,426 INFO L87 Difference]: Start difference. First operand 9999 states and 14794 transitions. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:45,471 INFO L93 Difference]: Finished difference Result 17934 states and 26525 transitions. [2025-01-09 08:19:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-01-09 08:19:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:45,480 INFO L225 Difference]: With dead ends: 17934 [2025-01-09 08:19:45,480 INFO L226 Difference]: Without dead ends: 10215 [2025-01-09 08:19:45,488 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-01-09 08:19:45,489 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 3 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:45,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3836 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2025-01-09 08:19:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 10215. [2025-01-09 08:19:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10215 states, 10214 states have (on average 1.4742510280007832) internal successors, (15058), 10214 states have internal predecessors, (15058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 15058 transitions. [2025-01-09 08:19:45,570 INFO L78 Accepts]: Start accepts. Automaton has 10215 states and 15058 transitions. Word has length 363 [2025-01-09 08:19:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 10215 states and 15058 transitions. [2025-01-09 08:19:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10215 states and 15058 transitions. [2025-01-09 08:19:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 08:19:45,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:45,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:45,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 08:19:45,575 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -735580891, now seen corresponding path program 1 times [2025-01-09 08:19:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282431560] [2025-01-09 08:19:45,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:45,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 08:19:46,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 08:19:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282431560] [2025-01-09 08:19:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282431560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:19:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440709067] [2025-01-09 08:19:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:19:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:47,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:19:47,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:19:47,387 INFO L87 Difference]: Start difference. First operand 10215 states and 15058 transitions. Second operand has 9 states, 9 states have (on average 40.333333333333336) internal successors, (363), 9 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:47,510 INFO L93 Difference]: Finished difference Result 17058 states and 25157 transitions. [2025-01-09 08:19:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:19:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.333333333333336) internal successors, (363), 9 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-01-09 08:19:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:47,519 INFO L225 Difference]: With dead ends: 17058 [2025-01-09 08:19:47,520 INFO L226 Difference]: Without dead ends: 10253 [2025-01-09 08:19:47,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:19:47,526 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 767 mSDsluCounter, 6291 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 7239 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:47,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 7239 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10253 states. [2025-01-09 08:19:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10253 to 10239. [2025-01-09 08:19:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 1.4737253369798788) internal successors, (15088), 10238 states have internal predecessors, (15088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 15088 transitions. [2025-01-09 08:19:47,608 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 15088 transitions. Word has length 363 [2025-01-09 08:19:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 10239 states and 15088 transitions. [2025-01-09 08:19:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.333333333333336) internal successors, (363), 9 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 15088 transitions. [2025-01-09 08:19:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 08:19:47,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:47,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:47,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 08:19:47,613 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2082132140, now seen corresponding path program 1 times [2025-01-09 08:19:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:47,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083690427] [2025-01-09 08:19:47,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:47,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 08:19:47,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 08:19:47,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:47,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083690427] [2025-01-09 08:19:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083690427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260359373] [2025-01-09 08:19:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:48,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:48,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:48,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:48,101 INFO L87 Difference]: Start difference. First operand 10239 states and 15088 transitions. Second operand has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:48,158 INFO L93 Difference]: Finished difference Result 17044 states and 25133 transitions. [2025-01-09 08:19:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:48,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-01-09 08:19:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:48,167 INFO L225 Difference]: With dead ends: 17044 [2025-01-09 08:19:48,167 INFO L226 Difference]: Without dead ends: 10239 [2025-01-09 08:19:48,173 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-01-09 08:19:48,173 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 515 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:48,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 3738 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2025-01-09 08:19:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 10239. [2025-01-09 08:19:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 10238 states have (on average 1.4735299863254543) internal successors, (15086), 10238 states have internal predecessors, (15086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 15086 transitions. [2025-01-09 08:19:48,248 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 15086 transitions. Word has length 363 [2025-01-09 08:19:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:48,248 INFO L471 AbstractCegarLoop]: Abstraction has 10239 states and 15086 transitions. [2025-01-09 08:19:48,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.6) internal successors, (363), 5 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 15086 transitions. [2025-01-09 08:19:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-01-09 08:19:48,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:48,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 08:19:48,253 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash 40842019, now seen corresponding path program 1 times [2025-01-09 08:19:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351632923] [2025-01-09 08:19:48,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:48,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-01-09 08:19:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-01-09 08:19:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351632923] [2025-01-09 08:19:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351632923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124144237] [2025-01-09 08:19:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:49,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:49,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:49,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:49,380 INFO L87 Difference]: Start difference. First operand 10239 states and 15086 transitions. Second operand has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:49,732 INFO L93 Difference]: Finished difference Result 20202 states and 29783 transitions. [2025-01-09 08:19:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-01-09 08:19:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:49,740 INFO L225 Difference]: With dead ends: 20202 [2025-01-09 08:19:49,740 INFO L226 Difference]: Without dead ends: 10247 [2025-01-09 08:19:49,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:49,747 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 139 mSDsluCounter, 4133 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:49,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 5019 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:19:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10247 states. [2025-01-09 08:19:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10247 to 10243. [2025-01-09 08:19:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 10242 states have (on average 1.4733450497949618) internal successors, (15090), 10242 states have internal predecessors, (15090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 15090 transitions. [2025-01-09 08:19:49,818 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 15090 transitions. Word has length 364 [2025-01-09 08:19:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 10243 states and 15090 transitions. [2025-01-09 08:19:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.0) internal successors, (364), 7 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 15090 transitions. [2025-01-09 08:19:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 08:19:49,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:49,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 08:19:49,824 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1453485454, now seen corresponding path program 1 times [2025-01-09 08:19:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152397015] [2025-01-09 08:19:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:49,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 08:19:50,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 08:19:50,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:50,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152397015] [2025-01-09 08:19:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152397015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:19:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613144290] [2025-01-09 08:19:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:19:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:19:50,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:50,976 INFO L87 Difference]: Start difference. First operand 10243 states and 15090 transitions. Second operand has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:51,105 INFO L93 Difference]: Finished difference Result 17322 states and 25529 transitions. [2025-01-09 08:19:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:19:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-01-09 08:19:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:51,114 INFO L225 Difference]: With dead ends: 17322 [2025-01-09 08:19:51,114 INFO L226 Difference]: Without dead ends: 10279 [2025-01-09 08:19:51,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:19:51,120 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 999 mSDsluCounter, 4707 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 5651 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:51,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 5651 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2025-01-09 08:19:51,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 10255. [2025-01-09 08:19:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10255 states, 10254 states have (on average 1.4727911059098888) internal successors, (15102), 10254 states have internal predecessors, (15102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10255 states to 10255 states and 15102 transitions. [2025-01-09 08:19:51,198 INFO L78 Accepts]: Start accepts. Automaton has 10255 states and 15102 transitions. Word has length 365 [2025-01-09 08:19:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 10255 states and 15102 transitions. [2025-01-09 08:19:51,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10255 states and 15102 transitions. [2025-01-09 08:19:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 08:19:51,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:51,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 08:19:51,204 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1298862094, now seen corresponding path program 1 times [2025-01-09 08:19:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632030937] [2025-01-09 08:19:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:51,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 08:19:51,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 08:19:51,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:51,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:52,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632030937] [2025-01-09 08:19:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632030937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:52,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109275065] [2025-01-09 08:19:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:52,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:52,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:52,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:52,011 INFO L87 Difference]: Start difference. First operand 10255 states and 15102 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:52,048 INFO L93 Difference]: Finished difference Result 17398 states and 25637 transitions. [2025-01-09 08:19:52,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-01-09 08:19:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:52,057 INFO L225 Difference]: With dead ends: 17398 [2025-01-09 08:19:52,058 INFO L226 Difference]: Without dead ends: 10327 [2025-01-09 08:19:52,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:52,064 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 0 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:52,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2875 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2025-01-09 08:19:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 10327. [2025-01-09 08:19:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10327 states, 10326 states have (on average 1.4706565950029054) internal successors, (15186), 10326 states have internal predecessors, (15186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10327 states to 10327 states and 15186 transitions. [2025-01-09 08:19:52,134 INFO L78 Accepts]: Start accepts. Automaton has 10327 states and 15186 transitions. Word has length 365 [2025-01-09 08:19:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:52,134 INFO L471 AbstractCegarLoop]: Abstraction has 10327 states and 15186 transitions. [2025-01-09 08:19:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 10327 states and 15186 transitions. [2025-01-09 08:19:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 08:19:52,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:52,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 08:19:52,140 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:52,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash 341085901, now seen corresponding path program 1 times [2025-01-09 08:19:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053971981] [2025-01-09 08:19:52,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:52,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 08:19:52,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 08:19:52,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:52,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053971981] [2025-01-09 08:19:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053971981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753834877] [2025-01-09 08:19:53,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:53,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:53,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:53,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 08:19:54,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 08:19:54,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 08:19:54,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:54,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:54,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 08:19:54,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:54,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753834877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:54,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:19:54,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-01-09 08:19:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351163617] [2025-01-09 08:19:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:54,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:19:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:54,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:19:54,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 08:19:54,920 INFO L87 Difference]: Start difference. First operand 10327 states and 15186 transitions. Second operand has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:55,095 INFO L93 Difference]: Finished difference Result 17380 states and 25567 transitions. [2025-01-09 08:19:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:19:55,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 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 366 [2025-01-09 08:19:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:55,105 INFO L225 Difference]: With dead ends: 17380 [2025-01-09 08:19:55,105 INFO L226 Difference]: Without dead ends: 10519 [2025-01-09 08:19:55,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 08:19:55,113 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 60 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 9457 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:55,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 9457 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10519 states. [2025-01-09 08:19:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10519 to 10407. [2025-01-09 08:19:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10407 states, 10406 states have (on average 1.4693446088794926) internal successors, (15290), 10406 states have internal predecessors, (15290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10407 states to 10407 states and 15290 transitions. [2025-01-09 08:19:55,193 INFO L78 Accepts]: Start accepts. Automaton has 10407 states and 15290 transitions. Word has length 366 [2025-01-09 08:19:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 10407 states and 15290 transitions. [2025-01-09 08:19:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.27272727272727) internal successors, (366), 11 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10407 states and 15290 transitions. [2025-01-09 08:19:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 08:19:55,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:55,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:55,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 08:19:55,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 08:19:55,402 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:55,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2008086668, now seen corresponding path program 1 times [2025-01-09 08:19:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:55,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926104855] [2025-01-09 08:19:55,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:55,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 08:19:56,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 08:19:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:56,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926104855] [2025-01-09 08:19:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926104855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:19:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133060118] [2025-01-09 08:19:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:56,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:19:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:19:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:19:56,888 INFO L87 Difference]: Start difference. First operand 10407 states and 15290 transitions. Second operand has 10 states, 10 states have (on average 36.7) internal successors, (367), 10 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:56,987 INFO L93 Difference]: Finished difference Result 17370 states and 25537 transitions. [2025-01-09 08:19:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:19:56,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 36.7) internal successors, (367), 10 states have internal predecessors, (367), 0 states have call successors, (0), 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 367 [2025-01-09 08:19:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:56,996 INFO L225 Difference]: With dead ends: 17370 [2025-01-09 08:19:56,996 INFO L226 Difference]: Without dead ends: 10445 [2025-01-09 08:19:57,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:19:57,003 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 521 mSDsluCounter, 7084 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 8033 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:57,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 8033 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10445 states. [2025-01-09 08:19:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10445 to 10435. [2025-01-09 08:19:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10435 states, 10434 states have (on average 1.4688518305539582) internal successors, (15326), 10434 states have internal predecessors, (15326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10435 states to 10435 states and 15326 transitions. [2025-01-09 08:19:57,079 INFO L78 Accepts]: Start accepts. Automaton has 10435 states and 15326 transitions. Word has length 367 [2025-01-09 08:19:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:57,079 INFO L471 AbstractCegarLoop]: Abstraction has 10435 states and 15326 transitions. [2025-01-09 08:19:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.7) internal successors, (367), 10 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 10435 states and 15326 transitions. [2025-01-09 08:19:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 08:19:57,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:57,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 08:19:57,085 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:57,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 969260002, now seen corresponding path program 1 times [2025-01-09 08:19:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376184303] [2025-01-09 08:19:57,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:57,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 08:19:57,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 08:19:57,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:57,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376184303] [2025-01-09 08:19:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376184303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:57,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:19:57,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415724604] [2025-01-09 08:19:57,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:19:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:57,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:19:57,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:19:57,848 INFO L87 Difference]: Start difference. First operand 10435 states and 15326 transitions. Second operand has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:57,933 INFO L93 Difference]: Finished difference Result 17614 states and 25881 transitions. [2025-01-09 08:19:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:19:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 0 states have call successors, (0), 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 367 [2025-01-09 08:19:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:57,944 INFO L225 Difference]: With dead ends: 17614 [2025-01-09 08:19:57,944 INFO L226 Difference]: Without dead ends: 10689 [2025-01-09 08:19:57,950 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-01-09 08:19:57,951 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 97 mSDsluCounter, 4260 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 5309 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:57,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 5309 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2025-01-09 08:19:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 10527. [2025-01-09 08:19:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10527 states, 10526 states have (on average 1.4674140224206726) internal successors, (15446), 10526 states have internal predecessors, (15446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10527 states to 10527 states and 15446 transitions. [2025-01-09 08:19:58,032 INFO L78 Accepts]: Start accepts. Automaton has 10527 states and 15446 transitions. Word has length 367 [2025-01-09 08:19:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:58,032 INFO L471 AbstractCegarLoop]: Abstraction has 10527 states and 15446 transitions. [2025-01-09 08:19:58,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.875) internal successors, (367), 8 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10527 states and 15446 transitions. [2025-01-09 08:19:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 08:19:58,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:58,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:58,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 08:19:58,037 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:58,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -660534412, now seen corresponding path program 1 times [2025-01-09 08:19:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:58,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576333564] [2025-01-09 08:19:58,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 08:19:58,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 08:19:58,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:58,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576333564] [2025-01-09 08:19:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576333564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655728990] [2025-01-09 08:19:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:59,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:59,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:59,207 INFO L87 Difference]: Start difference. First operand 10527 states and 15446 transitions. Second operand has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:59,268 INFO L93 Difference]: Finished difference Result 17558 states and 25793 transitions. [2025-01-09 08:19:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2025-01-09 08:19:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:59,279 INFO L225 Difference]: With dead ends: 17558 [2025-01-09 08:19:59,279 INFO L226 Difference]: Without dead ends: 10561 [2025-01-09 08:19:59,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:59,286 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 15 mSDsluCounter, 3826 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:59,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4782 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10561 states. [2025-01-09 08:19:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 10551. [2025-01-09 08:19:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10551 states, 10550 states have (on average 1.4672985781990522) internal successors, (15480), 10550 states have internal predecessors, (15480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10551 states to 10551 states and 15480 transitions. [2025-01-09 08:19:59,372 INFO L78 Accepts]: Start accepts. Automaton has 10551 states and 15480 transitions. Word has length 368 [2025-01-09 08:19:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 10551 states and 15480 transitions. [2025-01-09 08:19:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.57142857142857) internal successors, (368), 7 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 10551 states and 15480 transitions. [2025-01-09 08:19:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 08:19:59,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:59,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:59,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 08:19:59,378 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -757754174, now seen corresponding path program 1 times [2025-01-09 08:19:59,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483170102] [2025-01-09 08:19:59,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:59,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 08:20:00,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 08:20:00,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:00,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483170102] [2025-01-09 08:20:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483170102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:20:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822591213] [2025-01-09 08:20:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:20:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:20:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:00,863 INFO L87 Difference]: Start difference. First operand 10551 states and 15480 transitions. Second operand has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:01,057 INFO L93 Difference]: Finished difference Result 17930 states and 26329 transitions. [2025-01-09 08:20:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:20:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2025-01-09 08:20:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:01,066 INFO L225 Difference]: With dead ends: 17930 [2025-01-09 08:20:01,067 INFO L226 Difference]: Without dead ends: 10871 [2025-01-09 08:20:01,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:01,073 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 137 mSDsluCounter, 8819 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 9790 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:01,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 9790 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10871 states. [2025-01-09 08:20:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10871 to 10725. [2025-01-09 08:20:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10725 states, 10724 states have (on average 1.4673629242819843) internal successors, (15736), 10724 states have internal predecessors, (15736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10725 states to 10725 states and 15736 transitions. [2025-01-09 08:20:01,151 INFO L78 Accepts]: Start accepts. Automaton has 10725 states and 15736 transitions. Word has length 368 [2025-01-09 08:20:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:01,151 INFO L471 AbstractCegarLoop]: Abstraction has 10725 states and 15736 transitions. [2025-01-09 08:20:01,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10725 states and 15736 transitions. [2025-01-09 08:20:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 08:20:01,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:01,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:01,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 08:20:01,156 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1830507338, now seen corresponding path program 1 times [2025-01-09 08:20:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019129270] [2025-01-09 08:20:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:01,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 08:20:01,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 08:20:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:02,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019129270] [2025-01-09 08:20:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019129270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:02,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:20:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954553764] [2025-01-09 08:20:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:02,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:20:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:02,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:20:02,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:02,556 INFO L87 Difference]: Start difference. First operand 10725 states and 15736 transitions. Second operand has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:02,655 INFO L93 Difference]: Finished difference Result 23134 states and 33885 transitions. [2025-01-09 08:20:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2025-01-09 08:20:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:02,670 INFO L225 Difference]: With dead ends: 23134 [2025-01-09 08:20:02,670 INFO L226 Difference]: Without dead ends: 14445 [2025-01-09 08:20:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-01-09 08:20:02,680 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 120 mSDsluCounter, 6639 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 7590 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 7590 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14445 states. [2025-01-09 08:20:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14445 to 14373. [2025-01-09 08:20:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14373 states, 14372 states have (on average 1.4622877817979405) internal successors, (21016), 14372 states have internal predecessors, (21016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 21016 transitions. [2025-01-09 08:20:02,803 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 21016 transitions. Word has length 368 [2025-01-09 08:20:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:02,804 INFO L471 AbstractCegarLoop]: Abstraction has 14373 states and 21016 transitions. [2025-01-09 08:20:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.888888888888886) internal successors, (368), 9 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 21016 transitions. [2025-01-09 08:20:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 08:20:02,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:02,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:02,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 08:20:02,810 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1695463283, now seen corresponding path program 1 times [2025-01-09 08:20:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623796964] [2025-01-09 08:20:02,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:02,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 08:20:03,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 08:20:03,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:03,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:03,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623796964] [2025-01-09 08:20:03,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623796964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:03,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:03,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:03,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166533402] [2025-01-09 08:20:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:03,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:03,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:03,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:03,960 INFO L87 Difference]: Start difference. First operand 14373 states and 21016 transitions. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:04,032 INFO L93 Difference]: Finished difference Result 37380 states and 54721 transitions. [2025-01-09 08:20:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 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 369 [2025-01-09 08:20:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:04,057 INFO L225 Difference]: With dead ends: 37380 [2025-01-09 08:20:04,057 INFO L226 Difference]: Without dead ends: 27707 [2025-01-09 08:20:04,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:04,070 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 397 mSDsluCounter, 3831 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 4792 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:04,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 4792 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27707 states. [2025-01-09 08:20:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27707 to 27707. [2025-01-09 08:20:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27707 states, 27706 states have (on average 1.463654082148271) internal successors, (40552), 27706 states have internal predecessors, (40552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27707 states to 27707 states and 40552 transitions. [2025-01-09 08:20:04,281 INFO L78 Accepts]: Start accepts. Automaton has 27707 states and 40552 transitions. Word has length 369 [2025-01-09 08:20:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:04,282 INFO L471 AbstractCegarLoop]: Abstraction has 27707 states and 40552 transitions. [2025-01-09 08:20:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27707 states and 40552 transitions. [2025-01-09 08:20:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 08:20:04,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:04,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 08:20:04,292 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1256057579, now seen corresponding path program 1 times [2025-01-09 08:20:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470370756] [2025-01-09 08:20:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:04,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-01-09 08:20:04,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-01-09 08:20:04,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:04,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470370756] [2025-01-09 08:20:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470370756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:20:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654731018] [2025-01-09 08:20:05,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:05,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:20:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:05,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:20:05,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:05,237 INFO L87 Difference]: Start difference. First operand 27707 states and 40552 transitions. Second operand has 9 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:05,372 INFO L93 Difference]: Finished difference Result 46504 states and 68081 transitions. [2025-01-09 08:20:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:20:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 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 370 [2025-01-09 08:20:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:05,406 INFO L225 Difference]: With dead ends: 46504 [2025-01-09 08:20:05,406 INFO L226 Difference]: Without dead ends: 28037 [2025-01-09 08:20:05,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:05,422 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 54 mSDsluCounter, 6646 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 7598 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:05,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 7598 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28037 states. [2025-01-09 08:20:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28037 to 28029. [2025-01-09 08:20:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28029 states, 28028 states have (on average 1.4631083202511774) internal successors, (41008), 28028 states have internal predecessors, (41008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28029 states to 28029 states and 41008 transitions. [2025-01-09 08:20:05,638 INFO L78 Accepts]: Start accepts. Automaton has 28029 states and 41008 transitions. Word has length 370 [2025-01-09 08:20:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 28029 states and 41008 transitions. [2025-01-09 08:20:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.111111111111114) internal successors, (370), 9 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:20:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 28029 states and 41008 transitions. [2025-01-09 08:20:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-01-09 08:20:05,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:05,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:20:05,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 08:20:05,648 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:05,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1085848814, now seen corresponding path program 1 times [2025-01-09 08:20:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280952420] [2025-01-09 08:20:05,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:05,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes.