./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.2.prop1-func-interl.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.loyd.2.prop1-func-interl.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 844815abc3e9ea07a8b96661d60f5d4b47a75b6092b0ca1eb4feb4f55b41ed76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:36:19,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:36:19,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:36:19,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:36:19,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:36:19,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:36:19,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:36:19,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:36:19,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:36:19,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:36:19,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:36:19,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:36:19,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:36:19,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:36:19,140 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:36:19,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:36:19,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:36:19,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:36:19,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:36:19,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:36:19,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:36:19,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:36:19,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:36:19,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:36:19,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:36:19,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:36:19,146 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 -> 844815abc3e9ea07a8b96661d60f5d4b47a75b6092b0ca1eb4feb4f55b41ed76 [2025-01-09 07:36:19,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:36:19,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:36:19,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:36:19,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:36:19,378 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:36:19,379 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.loyd.2.prop1-func-interl.c [2025-01-09 07:36:20,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31f83fe0c/545572f149a44cc0b457b0831db5b2f8/FLAG6283bb68d [2025-01-09 07:36:20,851 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:36:20,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.loyd.2.prop1-func-interl.c [2025-01-09 07:36:20,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31f83fe0c/545572f149a44cc0b457b0831db5b2f8/FLAG6283bb68d [2025-01-09 07:36:21,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31f83fe0c/545572f149a44cc0b457b0831db5b2f8 [2025-01-09 07:36:21,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:36:21,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:36:21,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:36:21,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:36:21,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:36:21,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:21,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21, skipping insertion in model container [2025-01-09 07:36:21,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:21,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:36:21,312 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.loyd.2.prop1-func-interl.c[1171,1184] [2025-01-09 07:36:21,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:36:21,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:36:21,578 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.loyd.2.prop1-func-interl.c[1171,1184] [2025-01-09 07:36:21,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:36:21,718 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:36:21,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21 WrapperNode [2025-01-09 07:36:21,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:36:21,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:36:21,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:36:21,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:36:21,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:21,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,044 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3279 [2025-01-09 07:36:22,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:36:22,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:36:22,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:36:22,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:36:22,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 07:36:22,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:36:22,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:36:22,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:36:22,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:36:22,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (1/1) ... [2025-01-09 07:36:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:36:22,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:36:22,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:36:22,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:36:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:36:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:36:22,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:36:22,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:36:22,851 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:36:22,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:36:25,354 INFO L? ?]: Removed 2023 outVars from TransFormulas that were not future-live. [2025-01-09 07:36:25,354 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:36:25,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:36:25,381 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:36:25,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:36:25 BoogieIcfgContainer [2025-01-09 07:36:25,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:36:25,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:36:25,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:36:25,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:36:25,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:36:21" (1/3) ... [2025-01-09 07:36:25,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6e0239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:36:25, skipping insertion in model container [2025-01-09 07:36:25,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:36:21" (2/3) ... [2025-01-09 07:36:25,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6e0239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:36:25, skipping insertion in model container [2025-01-09 07:36:25,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:36:25" (3/3) ... [2025-01-09 07:36:25,394 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.loyd.2.prop1-func-interl.c [2025-01-09 07:36:25,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:36:25,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.loyd.2.prop1-func-interl.c that has 1 procedures, 986 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:36:25,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:36:25,481 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;@26e9a242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:36:25,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:36:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 986 states, 984 states have (on average 1.5071138211382114) internal successors, (1483), 985 states have internal predecessors, (1483), 0 states have call successors, (0), 0 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 07:36:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 07:36:25,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:25,497 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] [2025-01-09 07:36:25,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1850606872, now seen corresponding path program 1 times [2025-01-09 07:36:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022363967] [2025-01-09 07:36:25,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:25,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 07:36:25,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 07:36:25,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:25,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:25,985 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 07:36:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022363967] [2025-01-09 07:36:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022363967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220319028] [2025-01-09 07:36:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:26,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:26,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:26,005 INFO L87 Difference]: Start difference. First operand has 986 states, 984 states have (on average 1.5071138211382114) internal successors, (1483), 985 states have internal predecessors, (1483), 0 states have call successors, (0), 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.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:36:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:26,109 INFO L93 Difference]: Finished difference Result 1909 states and 2875 transitions. [2025-01-09 07:36:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:26,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-01-09 07:36:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:26,128 INFO L225 Difference]: With dead ends: 1909 [2025-01-09 07:36:26,128 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 07:36:26,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:26,134 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 0 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:26,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4425 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 07:36:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2025-01-09 07:36:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 1.5050813008130082) internal successors, (1481), 984 states have internal predecessors, (1481), 0 states have call successors, (0), 0 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 07:36:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1481 transitions. [2025-01-09 07:36:26,205 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1481 transitions. Word has length 49 [2025-01-09 07:36:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:26,205 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1481 transitions. [2025-01-09 07:36:26,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 07:36:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1481 transitions. [2025-01-09 07:36:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 07:36:26,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:26,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:26,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:36:26,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:26,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1535933623, now seen corresponding path program 1 times [2025-01-09 07:36:26,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:26,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385868163] [2025-01-09 07:36:26,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:26,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 07:36:26,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 07:36:26,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:26,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:26,516 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 07:36:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385868163] [2025-01-09 07:36:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385868163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912756482] [2025-01-09 07:36:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:26,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:26,520 INFO L87 Difference]: Start difference. First operand 985 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:36:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:26,572 INFO L93 Difference]: Finished difference Result 1910 states and 2873 transitions. [2025-01-09 07:36:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:26,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 07:36:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:26,576 INFO L225 Difference]: With dead ends: 1910 [2025-01-09 07:36:26,576 INFO L226 Difference]: Without dead ends: 987 [2025-01-09 07:36:26,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:26,579 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 0 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:26,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4421 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-01-09 07:36:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2025-01-09 07:36:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 986 states have (on average 1.5040567951318458) internal successors, (1483), 986 states have internal predecessors, (1483), 0 states have call successors, (0), 0 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 07:36:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1483 transitions. [2025-01-09 07:36:26,606 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1483 transitions. Word has length 50 [2025-01-09 07:36:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:26,606 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1483 transitions. [2025-01-09 07:36:26,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:36:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1483 transitions. [2025-01-09 07:36:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 07:36:26,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:26,609 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 07:36:26,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:36:26,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -728663599, now seen corresponding path program 1 times [2025-01-09 07:36:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54703730] [2025-01-09 07:36:26,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:26,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 07:36:26,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 07:36:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:26,794 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 07:36:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54703730] [2025-01-09 07:36:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54703730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:36:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695468438] [2025-01-09 07:36:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:26,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:36:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:36:26,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:26,795 INFO L87 Difference]: Start difference. First operand 987 states and 1483 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 07:36:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:26,877 INFO L93 Difference]: Finished difference Result 2775 states and 4174 transitions. [2025-01-09 07:36:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:36:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 07:36:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:26,886 INFO L225 Difference]: With dead ends: 2775 [2025-01-09 07:36:26,886 INFO L226 Difference]: Without dead ends: 1850 [2025-01-09 07:36:26,888 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 07:36:26,890 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 1354 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:26,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 5795 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-01-09 07:36:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1009. [2025-01-09 07:36:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.5029761904761905) internal successors, (1515), 1008 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 07:36:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1515 transitions. [2025-01-09 07:36:26,917 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1515 transitions. Word has length 51 [2025-01-09 07:36:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:26,918 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1515 transitions. [2025-01-09 07:36:26,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 07:36:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1515 transitions. [2025-01-09 07:36:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 07:36:26,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:26,928 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:36:26,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1342584990, now seen corresponding path program 1 times [2025-01-09 07:36:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002131838] [2025-01-09 07:36:26,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:27,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 07:36:27,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 07:36:27,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002131838] [2025-01-09 07:36:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002131838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743400687] [2025-01-09 07:36:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:28,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:28,445 INFO L87 Difference]: Start difference. First operand 1009 states and 1515 transitions. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 07:36:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:28,514 INFO L93 Difference]: Finished difference Result 1934 states and 2906 transitions. [2025-01-09 07:36:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 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 504 [2025-01-09 07:36:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:28,518 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:28,518 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:28,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:28,520 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1415 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:28,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 2938 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.501984126984127) internal successors, (1514), 1008 states have internal predecessors, (1514), 0 states have call successors, (0), 0 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 07:36:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1514 transitions. [2025-01-09 07:36:28,537 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1514 transitions. Word has length 504 [2025-01-09 07:36:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:28,537 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1514 transitions. [2025-01-09 07:36:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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 07:36:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1514 transitions. [2025-01-09 07:36:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-01-09 07:36:28,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:28,543 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:28,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:36:28,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1509626399, now seen corresponding path program 1 times [2025-01-09 07:36:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218735975] [2025-01-09 07:36:28,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:28,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-01-09 07:36:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-01-09 07:36:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218735975] [2025-01-09 07:36:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218735975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667951873] [2025-01-09 07:36:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:29,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:29,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:29,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:29,706 INFO L87 Difference]: Start difference. First operand 1009 states and 1514 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 07:36:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:29,748 INFO L93 Difference]: Finished difference Result 1934 states and 2904 transitions. [2025-01-09 07:36:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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 505 [2025-01-09 07:36:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:29,752 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:29,752 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:29,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:29,754 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 1409 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:29,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 2936 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.5009920634920635) internal successors, (1513), 1008 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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 07:36:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1513 transitions. [2025-01-09 07:36:29,770 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1513 transitions. Word has length 505 [2025-01-09 07:36:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:29,771 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1513 transitions. [2025-01-09 07:36:29,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 07:36:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1513 transitions. [2025-01-09 07:36:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-01-09 07:36:29,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:29,777 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:36:29,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1759378479, now seen corresponding path program 1 times [2025-01-09 07:36:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495090509] [2025-01-09 07:36:29,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 07:36:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 07:36:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495090509] [2025-01-09 07:36:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495090509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268256638] [2025-01-09 07:36:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:31,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:31,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:31,177 INFO L87 Difference]: Start difference. First operand 1009 states and 1513 transitions. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 07:36:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:31,227 INFO L93 Difference]: Finished difference Result 1934 states and 2902 transitions. [2025-01-09 07:36:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 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 506 [2025-01-09 07:36:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:31,231 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:31,231 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:31,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:31,232 INFO L435 NwaCegarLoop]: 1468 mSDtfsCounter, 1403 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:31,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 2934 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.5) internal successors, (1512), 1008 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 07:36:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1512 transitions. [2025-01-09 07:36:31,250 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1512 transitions. Word has length 506 [2025-01-09 07:36:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:31,251 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1512 transitions. [2025-01-09 07:36:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 07:36:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1512 transitions. [2025-01-09 07:36:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-01-09 07:36:31,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:31,258 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:31,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:36:31,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:31,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -131046158, now seen corresponding path program 1 times [2025-01-09 07:36:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:31,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960888521] [2025-01-09 07:36:31,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:31,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-01-09 07:36:31,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-01-09 07:36:31,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:31,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960888521] [2025-01-09 07:36:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960888521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220962280] [2025-01-09 07:36:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:32,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:32,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:32,321 INFO L87 Difference]: Start difference. First operand 1009 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 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 07:36:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:32,374 INFO L93 Difference]: Finished difference Result 1934 states and 2900 transitions. [2025-01-09 07:36:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 507 [2025-01-09 07:36:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:32,378 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:32,380 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:32,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:32,382 INFO L435 NwaCegarLoop]: 1467 mSDtfsCounter, 1397 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:32,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2932 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:32,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4990079365079365) internal successors, (1511), 1008 states have internal predecessors, (1511), 0 states have call successors, (0), 0 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 07:36:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1511 transitions. [2025-01-09 07:36:32,399 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1511 transitions. Word has length 507 [2025-01-09 07:36:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:32,400 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1511 transitions. [2025-01-09 07:36:32,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 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 07:36:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1511 transitions. [2025-01-09 07:36:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-01-09 07:36:32,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:32,406 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:36:32,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash -375880188, now seen corresponding path program 1 times [2025-01-09 07:36:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114578735] [2025-01-09 07:36:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:32,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-01-09 07:36:32,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-01-09 07:36:32,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:32,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114578735] [2025-01-09 07:36:33,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114578735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:33,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:33,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:33,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762349124] [2025-01-09 07:36:33,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:33,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:33,200 INFO L87 Difference]: Start difference. First operand 1009 states and 1511 transitions. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 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 07:36:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:33,244 INFO L93 Difference]: Finished difference Result 1934 states and 2898 transitions. [2025-01-09 07:36:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:33,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 508 [2025-01-09 07:36:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:33,248 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:33,248 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:33,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:33,250 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 1391 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:33,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 2930 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.498015873015873) internal successors, (1510), 1008 states have internal predecessors, (1510), 0 states have call successors, (0), 0 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 07:36:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1510 transitions. [2025-01-09 07:36:33,270 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1510 transitions. Word has length 508 [2025-01-09 07:36:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:33,270 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1510 transitions. [2025-01-09 07:36:33,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 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 07:36:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1510 transitions. [2025-01-09 07:36:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-01-09 07:36:33,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:33,278 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:33,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:36:33,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:33,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 269412037, now seen corresponding path program 1 times [2025-01-09 07:36:33,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:33,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960724006] [2025-01-09 07:36:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-01-09 07:36:33,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-01-09 07:36:33,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:33,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960724006] [2025-01-09 07:36:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960724006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:34,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:34,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138864097] [2025-01-09 07:36:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:34,009 INFO L87 Difference]: Start difference. First operand 1009 states and 1510 transitions. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 07:36:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:34,054 INFO L93 Difference]: Finished difference Result 1934 states and 2896 transitions. [2025-01-09 07:36:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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 509 [2025-01-09 07:36:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:34,058 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:34,058 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:34,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:34,060 INFO L435 NwaCegarLoop]: 1465 mSDtfsCounter, 1385 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:34,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 2928 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4970238095238095) internal successors, (1509), 1008 states have internal predecessors, (1509), 0 states have call successors, (0), 0 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 07:36:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1509 transitions. [2025-01-09 07:36:34,076 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1509 transitions. Word has length 509 [2025-01-09 07:36:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:34,077 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1509 transitions. [2025-01-09 07:36:34,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 07:36:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1509 transitions. [2025-01-09 07:36:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-01-09 07:36:34,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:34,080 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 07:36:34,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1286324023, now seen corresponding path program 1 times [2025-01-09 07:36:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650515419] [2025-01-09 07:36:34,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:34,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-01-09 07:36:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-01-09 07:36:34,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650515419] [2025-01-09 07:36:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650515419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494812807] [2025-01-09 07:36:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:34,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:34,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:34,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:34,903 INFO L87 Difference]: Start difference. First operand 1009 states and 1509 transitions. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 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 07:36:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:34,955 INFO L93 Difference]: Finished difference Result 1934 states and 2894 transitions. [2025-01-09 07:36:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 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 510 [2025-01-09 07:36:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:34,959 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:34,959 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:34,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:34,961 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 1379 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:34,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 2926 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.496031746031746) internal successors, (1508), 1008 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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 07:36:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1508 transitions. [2025-01-09 07:36:34,979 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1508 transitions. Word has length 510 [2025-01-09 07:36:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:34,979 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1508 transitions. [2025-01-09 07:36:34,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 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 07:36:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1508 transitions. [2025-01-09 07:36:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-01-09 07:36:34,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:34,984 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:34,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:36:34,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:34,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1828362136, now seen corresponding path program 1 times [2025-01-09 07:36:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:34,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270117854] [2025-01-09 07:36:34,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:35,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-09 07:36:35,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-09 07:36:35,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:35,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:35,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270117854] [2025-01-09 07:36:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270117854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274551722] [2025-01-09 07:36:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:35,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:35,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:35,649 INFO L87 Difference]: Start difference. First operand 1009 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 07:36:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:35,694 INFO L93 Difference]: Finished difference Result 1934 states and 2892 transitions. [2025-01-09 07:36:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:35,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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 511 [2025-01-09 07:36:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:35,697 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:35,697 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:35,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:35,700 INFO L435 NwaCegarLoop]: 1463 mSDtfsCounter, 1373 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:35,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 2924 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4950396825396826) internal successors, (1507), 1008 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 07:36:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1507 transitions. [2025-01-09 07:36:35,716 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1507 transitions. Word has length 511 [2025-01-09 07:36:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:35,717 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1507 transitions. [2025-01-09 07:36:35,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 07:36:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1507 transitions. [2025-01-09 07:36:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-01-09 07:36:35,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:35,720 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:35,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:36:35,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:35,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1394757782, now seen corresponding path program 1 times [2025-01-09 07:36:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:35,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458282908] [2025-01-09 07:36:35,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:35,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-01-09 07:36:35,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-01-09 07:36:35,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:35,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458282908] [2025-01-09 07:36:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458282908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21945824] [2025-01-09 07:36:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:36,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:36,433 INFO L87 Difference]: Start difference. First operand 1009 states and 1507 transitions. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 07:36:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:36,475 INFO L93 Difference]: Finished difference Result 1934 states and 2890 transitions. [2025-01-09 07:36:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 512 [2025-01-09 07:36:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:36,479 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:36,479 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:36,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:36,481 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 1317 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:36,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2922 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.494047619047619) internal successors, (1506), 1008 states have internal predecessors, (1506), 0 states have call successors, (0), 0 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 07:36:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1506 transitions. [2025-01-09 07:36:36,498 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1506 transitions. Word has length 512 [2025-01-09 07:36:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:36,498 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1506 transitions. [2025-01-09 07:36:36,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 07:36:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1506 transitions. [2025-01-09 07:36:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 07:36:36,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:36,501 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:36,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:36:36,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:36,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1941645062, now seen corresponding path program 1 times [2025-01-09 07:36:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:36,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840803811] [2025-01-09 07:36:36,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 07:36:36,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 07:36:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840803811] [2025-01-09 07:36:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840803811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:37,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:37,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098816970] [2025-01-09 07:36:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:37,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:37,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:37,250 INFO L87 Difference]: Start difference. First operand 1009 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:36:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:37,292 INFO L93 Difference]: Finished difference Result 1934 states and 2888 transitions. [2025-01-09 07:36:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:37,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2025-01-09 07:36:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:37,295 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:37,296 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:37,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:37,297 INFO L435 NwaCegarLoop]: 1461 mSDtfsCounter, 1289 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:37,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 2920 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4930555555555556) internal successors, (1505), 1008 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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 07:36:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1505 transitions. [2025-01-09 07:36:37,314 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1505 transitions. Word has length 513 [2025-01-09 07:36:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1505 transitions. [2025-01-09 07:36:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:36:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1505 transitions. [2025-01-09 07:36:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-01-09 07:36:37,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:37,318 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 07:36:37,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -905277654, now seen corresponding path program 1 times [2025-01-09 07:36:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783981019] [2025-01-09 07:36:37,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:37,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-01-09 07:36:37,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-01-09 07:36:37,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:37,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:38,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783981019] [2025-01-09 07:36:38,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783981019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:38,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:38,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:38,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479983936] [2025-01-09 07:36:38,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:38,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:38,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:38,010 INFO L87 Difference]: Start difference. First operand 1009 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 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 07:36:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:38,049 INFO L93 Difference]: Finished difference Result 1934 states and 2886 transitions. [2025-01-09 07:36:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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 514 [2025-01-09 07:36:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:38,053 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:38,054 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:38,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:38,055 INFO L435 NwaCegarLoop]: 1460 mSDtfsCounter, 1261 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:38,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2918 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.492063492063492) internal successors, (1504), 1008 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 07:36:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1504 transitions. [2025-01-09 07:36:38,073 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1504 transitions. Word has length 514 [2025-01-09 07:36:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:38,074 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1504 transitions. [2025-01-09 07:36:38,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 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 07:36:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1504 transitions. [2025-01-09 07:36:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-01-09 07:36:38,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:38,111 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:38,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 07:36:38,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:38,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash 966851770, now seen corresponding path program 1 times [2025-01-09 07:36:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279244072] [2025-01-09 07:36:38,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:38,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-01-09 07:36:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-01-09 07:36:38,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279244072] [2025-01-09 07:36:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279244072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707715913] [2025-01-09 07:36:38,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:38,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:38,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:38,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:38,958 INFO L87 Difference]: Start difference. First operand 1009 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 07:36:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:39,006 INFO L93 Difference]: Finished difference Result 1934 states and 2884 transitions. [2025-01-09 07:36:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 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 515 [2025-01-09 07:36:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:39,010 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:39,010 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:39,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:39,013 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 1233 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:39,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 2916 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4910714285714286) internal successors, (1503), 1008 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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 07:36:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1503 transitions. [2025-01-09 07:36:39,037 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1503 transitions. Word has length 515 [2025-01-09 07:36:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:39,038 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1503 transitions. [2025-01-09 07:36:39,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 07:36:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1503 transitions. [2025-01-09 07:36:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-09 07:36:39,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:39,044 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:39,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 07:36:39,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:39,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1751691542, now seen corresponding path program 1 times [2025-01-09 07:36:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:39,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978215536] [2025-01-09 07:36:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:39,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-09 07:36:39,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-09 07:36:39,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978215536] [2025-01-09 07:36:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978215536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:39,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:39,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:39,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974625361] [2025-01-09 07:36:39,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:39,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:39,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:39,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:39,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:39,677 INFO L87 Difference]: Start difference. First operand 1009 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 07:36:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:39,712 INFO L93 Difference]: Finished difference Result 1934 states and 2882 transitions. [2025-01-09 07:36:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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 516 [2025-01-09 07:36:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:39,715 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:39,715 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:39,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:39,717 INFO L435 NwaCegarLoop]: 1458 mSDtfsCounter, 1205 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:39,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 2914 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4900793650793651) internal successors, (1502), 1008 states have internal predecessors, (1502), 0 states have call successors, (0), 0 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 07:36:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1502 transitions. [2025-01-09 07:36:39,730 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1502 transitions. Word has length 516 [2025-01-09 07:36:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:39,730 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1502 transitions. [2025-01-09 07:36:39,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 07:36:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1502 transitions. [2025-01-09 07:36:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-01-09 07:36:39,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:39,750 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:39,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 07:36:39,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1912602502, now seen corresponding path program 1 times [2025-01-09 07:36:39,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135435513] [2025-01-09 07:36:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 07:36:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 07:36:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135435513] [2025-01-09 07:36:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135435513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526156760] [2025-01-09 07:36:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:40,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:40,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:40,347 INFO L87 Difference]: Start difference. First operand 1009 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 07:36:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:40,385 INFO L93 Difference]: Finished difference Result 1934 states and 2880 transitions. [2025-01-09 07:36:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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 517 [2025-01-09 07:36:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:40,390 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:40,390 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:40,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:40,392 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 1177 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:40,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 2912 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4890873015873016) internal successors, (1501), 1008 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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 07:36:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1501 transitions. [2025-01-09 07:36:40,407 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1501 transitions. Word has length 517 [2025-01-09 07:36:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:40,408 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1501 transitions. [2025-01-09 07:36:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 07:36:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1501 transitions. [2025-01-09 07:36:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 07:36:40,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:40,411 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:40,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 07:36:40,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -53219670, now seen corresponding path program 1 times [2025-01-09 07:36:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902122753] [2025-01-09 07:36:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:40,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 07:36:40,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 07:36:40,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:40,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902122753] [2025-01-09 07:36:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902122753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641072593] [2025-01-09 07:36:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:41,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:41,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:41,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:41,021 INFO L87 Difference]: Start difference. First operand 1009 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 07:36:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:41,053 INFO L93 Difference]: Finished difference Result 1934 states and 2878 transitions. [2025-01-09 07:36:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:41,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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 518 [2025-01-09 07:36:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:41,057 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:41,057 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:41,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:41,058 INFO L435 NwaCegarLoop]: 1456 mSDtfsCounter, 1149 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2910 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:41,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2910 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4880952380952381) internal successors, (1500), 1008 states have internal predecessors, (1500), 0 states have call successors, (0), 0 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 07:36:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1500 transitions. [2025-01-09 07:36:41,071 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1500 transitions. Word has length 518 [2025-01-09 07:36:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1500 transitions. [2025-01-09 07:36:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 07:36:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1500 transitions. [2025-01-09 07:36:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 07:36:41,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:41,074 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 07:36:41,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2113004602, now seen corresponding path program 1 times [2025-01-09 07:36:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975166115] [2025-01-09 07:36:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:41,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 07:36:41,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 07:36:41,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:41,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975166115] [2025-01-09 07:36:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975166115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:41,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:41,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:36:41,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206989590] [2025-01-09 07:36:41,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:41,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:36:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:41,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:36:41,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:36:41,670 INFO L87 Difference]: Start difference. First operand 1009 states and 1500 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 07:36:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:41,701 INFO L93 Difference]: Finished difference Result 1934 states and 2876 transitions. [2025-01-09 07:36:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 519 [2025-01-09 07:36:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:41,704 INFO L225 Difference]: With dead ends: 1934 [2025-01-09 07:36:41,705 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 07:36:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:41,706 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 1121 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:41,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 2908 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 07:36:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2025-01-09 07:36:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4871031746031746) internal successors, (1499), 1008 states have internal predecessors, (1499), 0 states have call successors, (0), 0 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 07:36:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1499 transitions. [2025-01-09 07:36:41,718 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1499 transitions. Word has length 519 [2025-01-09 07:36:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:41,719 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1499 transitions. [2025-01-09 07:36:41,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 07:36:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1499 transitions. [2025-01-09 07:36:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 07:36:41,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:41,722 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:41,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 07:36:41,723 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 554724970, now seen corresponding path program 1 times [2025-01-09 07:36:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320902676] [2025-01-09 07:36:41,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:41,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 07:36:41,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 07:36:41,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:41,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 07:36:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320902676] [2025-01-09 07:36:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320902676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:36:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333609905] [2025-01-09 07:36:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:36:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:42,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:36:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:42,535 INFO L87 Difference]: Start difference. First operand 1009 states and 1499 transitions. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 07:36:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:42,574 INFO L93 Difference]: Finished difference Result 1938 states and 2879 transitions. [2025-01-09 07:36:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:36:42,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 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 520 [2025-01-09 07:36:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:42,578 INFO L225 Difference]: With dead ends: 1938 [2025-01-09 07:36:42,579 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 07:36:42,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:36:42,581 INFO L435 NwaCegarLoop]: 1461 mSDtfsCounter, 0 mSDsluCounter, 2906 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4367 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:42,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4367 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:36:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 07:36:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1009. [2025-01-09 07:36:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 1.4871031746031746) internal successors, (1499), 1008 states have internal predecessors, (1499), 0 states have call successors, (0), 0 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 07:36:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1499 transitions. [2025-01-09 07:36:42,596 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1499 transitions. Word has length 520 [2025-01-09 07:36:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:42,597 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1499 transitions. [2025-01-09 07:36:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 07:36:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1499 transitions. [2025-01-09 07:36:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-09 07:36:42,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:42,602 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 07:36:42,602 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:42,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 925491973, now seen corresponding path program 1 times [2025-01-09 07:36:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803728502] [2025-01-09 07:36:42,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:42,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-09 07:36:42,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-09 07:36:42,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:42,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:43,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803728502] [2025-01-09 07:36:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803728502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:43,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047732957] [2025-01-09 07:36:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:43,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:43,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:43,844 INFO L87 Difference]: Start difference. First operand 1009 states and 1499 transitions. Second operand has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 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 07:36:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:44,159 INFO L93 Difference]: Finished difference Result 1940 states and 2882 transitions. [2025-01-09 07:36:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:44,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 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 521 [2025-01-09 07:36:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:44,162 INFO L225 Difference]: With dead ends: 1940 [2025-01-09 07:36:44,162 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 07:36:44,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:44,164 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1398 mSDsluCounter, 4030 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 5378 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:44,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 5378 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:36:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 07:36:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2025-01-09 07:36:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4861386138613861) internal successors, (1501), 1010 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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 07:36:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1501 transitions. [2025-01-09 07:36:44,176 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1501 transitions. Word has length 521 [2025-01-09 07:36:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:44,177 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1501 transitions. [2025-01-09 07:36:44,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.83333333333333) internal successors, (521), 6 states have internal predecessors, (521), 0 states have call successors, (0), 0 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 07:36:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1501 transitions. [2025-01-09 07:36:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-01-09 07:36:44,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:44,179 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:44,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 07:36:44,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2138501616, now seen corresponding path program 1 times [2025-01-09 07:36:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495733104] [2025-01-09 07:36:44,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-09 07:36:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-09 07:36:44,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:44,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495733104] [2025-01-09 07:36:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495733104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171571171] [2025-01-09 07:36:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:44,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:44,999 INFO L87 Difference]: Start difference. First operand 1011 states and 1501 transitions. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 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 07:36:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:45,286 INFO L93 Difference]: Finished difference Result 1944 states and 2886 transitions. [2025-01-09 07:36:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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 522 [2025-01-09 07:36:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:45,292 INFO L225 Difference]: With dead ends: 1944 [2025-01-09 07:36:45,292 INFO L226 Difference]: Without dead ends: 1015 [2025-01-09 07:36:45,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:45,296 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1464 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 5375 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:45,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 5375 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:36:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-01-09 07:36:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1013. [2025-01-09 07:36:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.4851778656126482) internal successors, (1503), 1012 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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 07:36:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1503 transitions. [2025-01-09 07:36:45,307 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1503 transitions. Word has length 522 [2025-01-09 07:36:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:45,308 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1503 transitions. [2025-01-09 07:36:45,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 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 07:36:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1503 transitions. [2025-01-09 07:36:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-01-09 07:36:45,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:45,311 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 07:36:45,311 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash -970809056, now seen corresponding path program 1 times [2025-01-09 07:36:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877258415] [2025-01-09 07:36:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-01-09 07:36:45,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-01-09 07:36:45,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:45,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877258415] [2025-01-09 07:36:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877258415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499094421] [2025-01-09 07:36:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:46,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:46,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:46,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:46,302 INFO L87 Difference]: Start difference. First operand 1013 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 07:36:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:46,552 INFO L93 Difference]: Finished difference Result 1948 states and 2890 transitions. [2025-01-09 07:36:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 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 523 [2025-01-09 07:36:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:46,555 INFO L225 Difference]: With dead ends: 1948 [2025-01-09 07:36:46,555 INFO L226 Difference]: Without dead ends: 1017 [2025-01-09 07:36:46,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:46,556 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1458 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:46,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 5376 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-01-09 07:36:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2025-01-09 07:36:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4842209072978303) internal successors, (1505), 1014 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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 07:36:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1505 transitions. [2025-01-09 07:36:46,567 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1505 transitions. Word has length 523 [2025-01-09 07:36:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:46,567 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1505 transitions. [2025-01-09 07:36:46,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 07:36:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1505 transitions. [2025-01-09 07:36:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-01-09 07:36:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:46,570 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:46,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 07:36:46,570 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1038731893, now seen corresponding path program 1 times [2025-01-09 07:36:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134828418] [2025-01-09 07:36:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:46,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 07:36:46,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 07:36:46,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134828418] [2025-01-09 07:36:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134828418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:47,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:47,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753468833] [2025-01-09 07:36:47,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:47,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:47,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:47,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:47,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:47,441 INFO L87 Difference]: Start difference. First operand 1015 states and 1505 transitions. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 07:36:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:47,683 INFO L93 Difference]: Finished difference Result 1952 states and 2894 transitions. [2025-01-09 07:36:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 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 524 [2025-01-09 07:36:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:47,686 INFO L225 Difference]: With dead ends: 1952 [2025-01-09 07:36:47,686 INFO L226 Difference]: Without dead ends: 1019 [2025-01-09 07:36:47,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:47,687 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1450 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:47,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 5377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-01-09 07:36:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2025-01-09 07:36:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.483267716535433) internal successors, (1507), 1016 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 07:36:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1507 transitions. [2025-01-09 07:36:47,697 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1507 transitions. Word has length 524 [2025-01-09 07:36:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:47,698 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1507 transitions. [2025-01-09 07:36:47,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 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 07:36:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1507 transitions. [2025-01-09 07:36:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-09 07:36:47,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:47,700 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:47,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 07:36:47,701 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:47,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash -420886981, now seen corresponding path program 1 times [2025-01-09 07:36:47,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:47,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543704634] [2025-01-09 07:36:47,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:47,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-09 07:36:47,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-09 07:36:47,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:47,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543704634] [2025-01-09 07:36:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543704634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:48,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561008162] [2025-01-09 07:36:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:48,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:48,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:48,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:48,484 INFO L87 Difference]: Start difference. First operand 1017 states and 1507 transitions. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 07:36:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:48,716 INFO L93 Difference]: Finished difference Result 1956 states and 2898 transitions. [2025-01-09 07:36:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:48,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 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 525 [2025-01-09 07:36:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:48,718 INFO L225 Difference]: With dead ends: 1956 [2025-01-09 07:36:48,718 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 07:36:48,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:48,719 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1444 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:48,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 5377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 07:36:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1019. [2025-01-09 07:36:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4823182711198428) internal successors, (1509), 1018 states have internal predecessors, (1509), 0 states have call successors, (0), 0 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 07:36:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1509 transitions. [2025-01-09 07:36:48,730 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1509 transitions. Word has length 525 [2025-01-09 07:36:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:48,730 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1509 transitions. [2025-01-09 07:36:48,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 07:36:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1509 transitions. [2025-01-09 07:36:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-01-09 07:36:48,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:48,733 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 07:36:48,734 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1150117850, now seen corresponding path program 1 times [2025-01-09 07:36:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476956597] [2025-01-09 07:36:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-01-09 07:36:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-01-09 07:36:48,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:48,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:49,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476956597] [2025-01-09 07:36:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476956597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:49,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649428885] [2025-01-09 07:36:49,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:49,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:49,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:49,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:49,583 INFO L87 Difference]: Start difference. First operand 1019 states and 1509 transitions. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 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 07:36:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:49,852 INFO L93 Difference]: Finished difference Result 1960 states and 2902 transitions. [2025-01-09 07:36:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 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 526 [2025-01-09 07:36:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:49,854 INFO L225 Difference]: With dead ends: 1960 [2025-01-09 07:36:49,854 INFO L226 Difference]: Without dead ends: 1023 [2025-01-09 07:36:49,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:49,856 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1436 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:49,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 5377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:36:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-01-09 07:36:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1021. [2025-01-09 07:36:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 1.481372549019608) internal successors, (1511), 1020 states have internal predecessors, (1511), 0 states have call successors, (0), 0 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 07:36:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1511 transitions. [2025-01-09 07:36:49,864 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1511 transitions. Word has length 526 [2025-01-09 07:36:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:49,864 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1511 transitions. [2025-01-09 07:36:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 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 07:36:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1511 transitions. [2025-01-09 07:36:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-01-09 07:36:49,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:49,867 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:49,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 07:36:49,868 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:49,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1449443926, now seen corresponding path program 1 times [2025-01-09 07:36:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725537891] [2025-01-09 07:36:49,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:49,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:49,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-01-09 07:36:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-01-09 07:36:50,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:50,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:50,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725537891] [2025-01-09 07:36:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725537891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:50,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:50,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142661566] [2025-01-09 07:36:50,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:50,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:50,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:50,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:50,665 INFO L87 Difference]: Start difference. First operand 1021 states and 1511 transitions. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 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 07:36:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:50,890 INFO L93 Difference]: Finished difference Result 1964 states and 2906 transitions. [2025-01-09 07:36:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 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 527 [2025-01-09 07:36:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:50,892 INFO L225 Difference]: With dead ends: 1964 [2025-01-09 07:36:50,892 INFO L226 Difference]: Without dead ends: 1025 [2025-01-09 07:36:50,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:50,893 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1430 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:50,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 5377 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-01-09 07:36:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1023. [2025-01-09 07:36:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.4804305283757337) internal successors, (1513), 1022 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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 07:36:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1513 transitions. [2025-01-09 07:36:50,902 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1513 transitions. Word has length 527 [2025-01-09 07:36:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:50,902 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1513 transitions. [2025-01-09 07:36:50,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 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 07:36:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1513 transitions. [2025-01-09 07:36:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-01-09 07:36:50,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:50,905 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:50,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 07:36:50,905 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 52327999, now seen corresponding path program 1 times [2025-01-09 07:36:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342770543] [2025-01-09 07:36:50,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:50,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-09 07:36:51,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-09 07:36:51,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:51,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342770543] [2025-01-09 07:36:51,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342770543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:51,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013373643] [2025-01-09 07:36:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:51,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:51,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:51,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:51,691 INFO L87 Difference]: Start difference. First operand 1023 states and 1513 transitions. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 07:36:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:51,916 INFO L93 Difference]: Finished difference Result 1968 states and 2910 transitions. [2025-01-09 07:36:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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 528 [2025-01-09 07:36:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:51,918 INFO L225 Difference]: With dead ends: 1968 [2025-01-09 07:36:51,918 INFO L226 Difference]: Without dead ends: 1027 [2025-01-09 07:36:51,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:51,919 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1428 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:51,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 5376 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-01-09 07:36:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1025. [2025-01-09 07:36:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.4794921875) internal successors, (1515), 1024 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 07:36:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1515 transitions. [2025-01-09 07:36:51,928 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1515 transitions. Word has length 528 [2025-01-09 07:36:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:51,928 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1515 transitions. [2025-01-09 07:36:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 07:36:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1515 transitions. [2025-01-09 07:36:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-09 07:36:51,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:51,931 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:51,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 07:36:51,931 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:51,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1491532431, now seen corresponding path program 1 times [2025-01-09 07:36:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298754380] [2025-01-09 07:36:51,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:52,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-09 07:36:52,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-09 07:36:52,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:52,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298754380] [2025-01-09 07:36:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298754380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:36:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056649578] [2025-01-09 07:36:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:36:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:53,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:36:53,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:36:53,485 INFO L87 Difference]: Start difference. First operand 1025 states and 1515 transitions. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 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 07:36:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:53,726 INFO L93 Difference]: Finished difference Result 2495 states and 3683 transitions. [2025-01-09 07:36:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:36:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 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 529 [2025-01-09 07:36:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:53,729 INFO L225 Difference]: With dead ends: 2495 [2025-01-09 07:36:53,729 INFO L226 Difference]: Without dead ends: 1552 [2025-01-09 07:36:53,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:36:53,731 INFO L435 NwaCegarLoop]: 1413 mSDtfsCounter, 2775 mSDsluCounter, 4230 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 5643 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:53,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 5643 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:36:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-01-09 07:36:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1164. [2025-01-09 07:36:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.470335339638865) internal successors, (1710), 1163 states have internal predecessors, (1710), 0 states have call successors, (0), 0 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 07:36:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1710 transitions. [2025-01-09 07:36:53,746 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1710 transitions. Word has length 529 [2025-01-09 07:36:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1710 transitions. [2025-01-09 07:36:53,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 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 07:36:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1710 transitions. [2025-01-09 07:36:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 07:36:53,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:53,750 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:53,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 07:36:53,751 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 196509184, now seen corresponding path program 1 times [2025-01-09 07:36:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217702318] [2025-01-09 07:36:53,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:53,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 07:36:54,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 07:36:54,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:54,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217702318] [2025-01-09 07:36:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217702318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:36:54,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:36:54,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:36:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804707919] [2025-01-09 07:36:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:36:54,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:36:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:36:54,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:36:54,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:36:54,842 INFO L87 Difference]: Start difference. First operand 1164 states and 1710 transitions. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 07:36:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:36:55,023 INFO L93 Difference]: Finished difference Result 2648 states and 3896 transitions. [2025-01-09 07:36:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:36:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 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 530 [2025-01-09 07:36:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:36:55,025 INFO L225 Difference]: With dead ends: 2648 [2025-01-09 07:36:55,026 INFO L226 Difference]: Without dead ends: 1552 [2025-01-09 07:36:55,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:36:55,027 INFO L435 NwaCegarLoop]: 2019 mSDtfsCounter, 2130 mSDsluCounter, 7459 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 9478 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:36:55,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 9478 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:36:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2025-01-09 07:36:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1164. [2025-01-09 07:36:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.469475494411006) internal successors, (1709), 1163 states have internal predecessors, (1709), 0 states have call successors, (0), 0 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 07:36:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1709 transitions. [2025-01-09 07:36:55,042 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1709 transitions. Word has length 530 [2025-01-09 07:36:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:36:55,042 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1709 transitions. [2025-01-09 07:36:55,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 07:36:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1709 transitions. [2025-01-09 07:36:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 07:36:55,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:36:55,045 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:36:55,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 07:36:55,046 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:36:55,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:36:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1183957517, now seen corresponding path program 1 times [2025-01-09 07:36:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:36:55,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258990126] [2025-01-09 07:36:55,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:36:55,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 07:36:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 07:36:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:36:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:36:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258990126] [2025-01-09 07:36:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258990126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:36:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467263993] [2025-01-09 07:36:57,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:36:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:36:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:36:57,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:36:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:36:58,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 07:36:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 07:36:59,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:36:59,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:36:59,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 3376 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 07:36:59,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:37:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:00,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:37:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467263993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:00,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:37:00,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-01-09 07:37:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813755799] [2025-01-09 07:37:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:00,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 07:37:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:00,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 07:37:00,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 07:37:00,393 INFO L87 Difference]: Start difference. First operand 1164 states and 1709 transitions. Second operand has 9 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 07:37:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:00,798 INFO L93 Difference]: Finished difference Result 3834 states and 5639 transitions. [2025-01-09 07:37:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 07:37:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 0 states have call successors, (0), 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 530 [2025-01-09 07:37:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:00,802 INFO L225 Difference]: With dead ends: 3834 [2025-01-09 07:37:00,802 INFO L226 Difference]: Without dead ends: 2752 [2025-01-09 07:37:00,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-01-09 07:37:00,804 INFO L435 NwaCegarLoop]: 2003 mSDtfsCounter, 6571 mSDsluCounter, 9396 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6571 SdHoareTripleChecker+Valid, 11399 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:00,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6571 Valid, 11399 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:37:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-01-09 07:37:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 1178. [2025-01-09 07:37:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4689889549702633) internal successors, (1729), 1177 states have internal predecessors, (1729), 0 states have call successors, (0), 0 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 07:37:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1729 transitions. [2025-01-09 07:37:00,818 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1729 transitions. Word has length 530 [2025-01-09 07:37:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:00,818 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1729 transitions. [2025-01-09 07:37:00,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 07:37:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1729 transitions. [2025-01-09 07:37:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 07:37:00,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:00,820 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:00,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:37:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:37:01,025 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1712742347, now seen corresponding path program 1 times [2025-01-09 07:37:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017688979] [2025-01-09 07:37:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 07:37:01,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 07:37:01,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:01,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017688979] [2025-01-09 07:37:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017688979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:02,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:02,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724594659] [2025-01-09 07:37:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:02,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:02,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:02,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:02,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:02,612 INFO L87 Difference]: Start difference. First operand 1178 states and 1729 transitions. Second operand has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 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 07:37:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:02,826 INFO L93 Difference]: Finished difference Result 2662 states and 3914 transitions. [2025-01-09 07:37:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 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 531 [2025-01-09 07:37:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:02,828 INFO L225 Difference]: With dead ends: 2662 [2025-01-09 07:37:02,828 INFO L226 Difference]: Without dead ends: 1566 [2025-01-09 07:37:02,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:37:02,829 INFO L435 NwaCegarLoop]: 2007 mSDtfsCounter, 2188 mSDsluCounter, 5409 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 7416 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:02,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 7416 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:37:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-01-09 07:37:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1178. [2025-01-09 07:37:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4681393372982159) internal successors, (1728), 1177 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 07:37:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1728 transitions. [2025-01-09 07:37:02,846 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1728 transitions. Word has length 531 [2025-01-09 07:37:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:02,846 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1728 transitions. [2025-01-09 07:37:02,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 0 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 07:37:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1728 transitions. [2025-01-09 07:37:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 07:37:02,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:02,848 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:02,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 07:37:02,849 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1141396926, now seen corresponding path program 1 times [2025-01-09 07:37:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397240917] [2025-01-09 07:37:02,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 07:37:04,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 07:37:04,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:04,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:04,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:04,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397240917] [2025-01-09 07:37:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397240917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:37:04,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103036210] [2025-01-09 07:37:04,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:04,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:37:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:37:04,816 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 07:37:04,817 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 07:37:05,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 07:37:07,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 07:37:07,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:07,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 07:37:07,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:37:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:08,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:37:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103036210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:37:09,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 07:37:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 07:37:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292404032] [2025-01-09 07:37:09,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 07:37:09,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:37:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:09,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:37:09,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:37:09,050 INFO L87 Difference]: Start difference. First operand 1178 states and 1728 transitions. Second operand has 10 states, 10 states have (on average 57.4) internal successors, (574), 10 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 07:37:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:09,671 INFO L93 Difference]: Finished difference Result 5192 states and 7603 transitions. [2025-01-09 07:37:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:37:09,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 57.4) internal successors, (574), 10 states have internal predecessors, (574), 0 states have call successors, (0), 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 531 [2025-01-09 07:37:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:09,675 INFO L225 Difference]: With dead ends: 5192 [2025-01-09 07:37:09,675 INFO L226 Difference]: Without dead ends: 2230 [2025-01-09 07:37:09,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:37:09,678 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 3694 mSDsluCounter, 10521 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3694 SdHoareTripleChecker+Valid, 11915 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:09,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3694 Valid, 11915 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:37:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2025-01-09 07:37:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1178. [2025-01-09 07:37:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4672897196261683) internal successors, (1727), 1177 states have internal predecessors, (1727), 0 states have call successors, (0), 0 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 07:37:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1727 transitions. [2025-01-09 07:37:09,690 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1727 transitions. Word has length 531 [2025-01-09 07:37:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:09,690 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1727 transitions. [2025-01-09 07:37:09,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 57.4) internal successors, (574), 10 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 07:37:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1727 transitions. [2025-01-09 07:37:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 07:37:09,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:09,693 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:09,727 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 07:37:09,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:37:09,893 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 428856427, now seen corresponding path program 1 times [2025-01-09 07:37:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:09,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161502235] [2025-01-09 07:37:09,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:09,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 07:37:11,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 07:37:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161502235] [2025-01-09 07:37:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161502235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:12,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790410073] [2025-01-09 07:37:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:12,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:12,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:12,184 INFO L87 Difference]: Start difference. First operand 1178 states and 1727 transitions. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:12,423 INFO L93 Difference]: Finished difference Result 2816 states and 4129 transitions. [2025-01-09 07:37:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2025-01-09 07:37:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:12,426 INFO L225 Difference]: With dead ends: 2816 [2025-01-09 07:37:12,426 INFO L226 Difference]: Without dead ends: 1720 [2025-01-09 07:37:12,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:37:12,427 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 2686 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2686 SdHoareTripleChecker+Valid, 6089 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:12,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2686 Valid, 6089 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:37:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2025-01-09 07:37:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1331. [2025-01-09 07:37:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1330 states have (on average 1.4609022556390978) internal successors, (1943), 1330 states have internal predecessors, (1943), 0 states have call successors, (0), 0 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 07:37:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1943 transitions. [2025-01-09 07:37:12,439 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1943 transitions. Word has length 532 [2025-01-09 07:37:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:12,439 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1943 transitions. [2025-01-09 07:37:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1943 transitions. [2025-01-09 07:37:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 07:37:12,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:12,442 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:12,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 07:37:12,442 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:12,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash 895983367, now seen corresponding path program 1 times [2025-01-09 07:37:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983368251] [2025-01-09 07:37:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 07:37:14,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 07:37:14,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:14,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983368251] [2025-01-09 07:37:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983368251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221151594] [2025-01-09 07:37:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:14,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:14,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:14,730 INFO L87 Difference]: Start difference. First operand 1331 states and 1943 transitions. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:15,149 INFO L93 Difference]: Finished difference Result 3749 states and 5468 transitions. [2025-01-09 07:37:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2025-01-09 07:37:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:15,154 INFO L225 Difference]: With dead ends: 3749 [2025-01-09 07:37:15,154 INFO L226 Difference]: Without dead ends: 2500 [2025-01-09 07:37:15,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:15,155 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 1949 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:15,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 4650 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:37:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-01-09 07:37:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2253. [2025-01-09 07:37:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2252 states have (on average 1.4547069271758437) internal successors, (3276), 2252 states have internal predecessors, (3276), 0 states have call successors, (0), 0 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 07:37:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3276 transitions. [2025-01-09 07:37:15,177 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3276 transitions. Word has length 532 [2025-01-09 07:37:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:15,178 INFO L471 AbstractCegarLoop]: Abstraction has 2253 states and 3276 transitions. [2025-01-09 07:37:15,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3276 transitions. [2025-01-09 07:37:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 07:37:15,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:15,181 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:15,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 07:37:15,181 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 361402681, now seen corresponding path program 1 times [2025-01-09 07:37:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919455201] [2025-01-09 07:37:15,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:15,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 07:37:16,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 07:37:16,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:16,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919455201] [2025-01-09 07:37:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919455201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583450900] [2025-01-09 07:37:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:17,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:17,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:17,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:17,315 INFO L87 Difference]: Start difference. First operand 2253 states and 3276 transitions. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 07:37:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:17,539 INFO L93 Difference]: Finished difference Result 4746 states and 6949 transitions. [2025-01-09 07:37:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:17,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 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 533 [2025-01-09 07:37:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:17,543 INFO L225 Difference]: With dead ends: 4746 [2025-01-09 07:37:17,543 INFO L226 Difference]: Without dead ends: 3031 [2025-01-09 07:37:17,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:37:17,544 INFO L435 NwaCegarLoop]: 2158 mSDtfsCounter, 2097 mSDsluCounter, 5662 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2097 SdHoareTripleChecker+Valid, 7820 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:17,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2097 Valid, 7820 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:37:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2025-01-09 07:37:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2253. [2025-01-09 07:37:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2252 states have (on average 1.4538188277087034) internal successors, (3274), 2252 states have internal predecessors, (3274), 0 states have call successors, (0), 0 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 07:37:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3274 transitions. [2025-01-09 07:37:17,562 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3274 transitions. Word has length 533 [2025-01-09 07:37:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:17,562 INFO L471 AbstractCegarLoop]: Abstraction has 2253 states and 3274 transitions. [2025-01-09 07:37:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 07:37:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3274 transitions. [2025-01-09 07:37:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 07:37:17,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:17,565 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 07:37:17,565 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:17,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1810817738, now seen corresponding path program 1 times [2025-01-09 07:37:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160906609] [2025-01-09 07:37:17,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 07:37:19,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 07:37:19,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:19,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:19,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160906609] [2025-01-09 07:37:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160906609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:37:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796275941] [2025-01-09 07:37:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:19,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:37:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:37:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:37:19,954 INFO L87 Difference]: Start difference. First operand 2253 states and 3274 transitions. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 07:37:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:20,401 INFO L93 Difference]: Finished difference Result 3506 states and 5101 transitions. [2025-01-09 07:37:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:37:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 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 534 [2025-01-09 07:37:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:20,404 INFO L225 Difference]: With dead ends: 3506 [2025-01-09 07:37:20,404 INFO L226 Difference]: Without dead ends: 2257 [2025-01-09 07:37:20,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:37:20,406 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 1137 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:20,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 3296 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:37:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-09 07:37:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2255. [2025-01-09 07:37:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2254 states have (on average 1.453416149068323) internal successors, (3276), 2254 states have internal predecessors, (3276), 0 states have call successors, (0), 0 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 07:37:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3276 transitions. [2025-01-09 07:37:20,423 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3276 transitions. Word has length 534 [2025-01-09 07:37:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:20,423 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 3276 transitions. [2025-01-09 07:37:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 07:37:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3276 transitions. [2025-01-09 07:37:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-09 07:37:20,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:20,426 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 07:37:20,426 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:20,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1323219393, now seen corresponding path program 1 times [2025-01-09 07:37:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9665383] [2025-01-09 07:37:20,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:20,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 07:37:22,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 07:37:22,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:22,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9665383] [2025-01-09 07:37:23,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9665383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:23,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:23,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505625580] [2025-01-09 07:37:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:23,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:23,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:23,478 INFO L87 Difference]: Start difference. First operand 2255 states and 3276 transitions. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:24,123 INFO L93 Difference]: Finished difference Result 3775 states and 5500 transitions. [2025-01-09 07:37:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:24,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 535 [2025-01-09 07:37:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:24,126 INFO L225 Difference]: With dead ends: 3775 [2025-01-09 07:37:24,126 INFO L226 Difference]: Without dead ends: 2524 [2025-01-09 07:37:24,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:24,127 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 1023 mSDsluCounter, 4588 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 5743 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:24,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 5743 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 07:37:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2025-01-09 07:37:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2277. [2025-01-09 07:37:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.45298769771529) internal successors, (3307), 2276 states have internal predecessors, (3307), 0 states have call successors, (0), 0 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 07:37:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3307 transitions. [2025-01-09 07:37:24,147 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3307 transitions. Word has length 535 [2025-01-09 07:37:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:24,147 INFO L471 AbstractCegarLoop]: Abstraction has 2277 states and 3307 transitions. [2025-01-09 07:37:24,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:37:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3307 transitions. [2025-01-09 07:37:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 07:37:24,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:24,150 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 07:37:24,150 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1329140516, now seen corresponding path program 1 times [2025-01-09 07:37:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860972448] [2025-01-09 07:37:24,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:24,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 07:37:25,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 07:37:25,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:25,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860972448] [2025-01-09 07:37:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860972448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:26,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:26,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151004980] [2025-01-09 07:37:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:26,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:26,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:26,535 INFO L87 Difference]: Start difference. First operand 2277 states and 3307 transitions. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 07:37:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:26,995 INFO L93 Difference]: Finished difference Result 6584 states and 9556 transitions. [2025-01-09 07:37:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 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 536 [2025-01-09 07:37:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:26,999 INFO L225 Difference]: With dead ends: 6584 [2025-01-09 07:37:26,999 INFO L226 Difference]: Without dead ends: 5333 [2025-01-09 07:37:27,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:27,001 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 2673 mSDsluCounter, 4386 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:27,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 5565 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 07:37:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5333 states. [2025-01-09 07:37:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5333 to 5043. [2025-01-09 07:37:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5043 states, 5042 states have (on average 1.448036493454978) internal successors, (7301), 5042 states have internal predecessors, (7301), 0 states have call successors, (0), 0 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 07:37:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5043 states to 5043 states and 7301 transitions. [2025-01-09 07:37:27,042 INFO L78 Accepts]: Start accepts. Automaton has 5043 states and 7301 transitions. Word has length 536 [2025-01-09 07:37:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:27,042 INFO L471 AbstractCegarLoop]: Abstraction has 5043 states and 7301 transitions. [2025-01-09 07:37:27,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 07:37:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5043 states and 7301 transitions. [2025-01-09 07:37:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 07:37:27,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:27,046 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:27,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 07:37:27,046 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:27,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -726603060, now seen corresponding path program 1 times [2025-01-09 07:37:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56086783] [2025-01-09 07:37:27,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:27,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 07:37:29,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 07:37:29,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:29,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:37:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:37:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:37:29,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56086783] [2025-01-09 07:37:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56086783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:37:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:37:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:37:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004153437] [2025-01-09 07:37:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:37:29,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:37:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:37:29,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:37:29,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:29,746 INFO L87 Difference]: Start difference. First operand 5043 states and 7301 transitions. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 07:37:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:37:30,445 INFO L93 Difference]: Finished difference Result 8271 states and 11986 transitions. [2025-01-09 07:37:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:37:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 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 537 [2025-01-09 07:37:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:37:30,452 INFO L225 Difference]: With dead ends: 8271 [2025-01-09 07:37:30,453 INFO L226 Difference]: Without dead ends: 5202 [2025-01-09 07:37:30,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:37:30,457 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 2255 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 4485 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 07:37:30,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 4485 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 07:37:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2025-01-09 07:37:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 4196. [2025-01-09 07:37:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4195 states have (on average 1.4491060786650776) internal successors, (6079), 4195 states have internal predecessors, (6079), 0 states have call successors, (0), 0 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 07:37:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6079 transitions. [2025-01-09 07:37:30,493 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6079 transitions. Word has length 537 [2025-01-09 07:37:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:37:30,493 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6079 transitions. [2025-01-09 07:37:30,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 07:37:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6079 transitions. [2025-01-09 07:37:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 07:37:30,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:37:30,497 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:37:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 07:37:30,497 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:37:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:37:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 424606696, now seen corresponding path program 1 times [2025-01-09 07:37:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:37:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669006812] [2025-01-09 07:37:30,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:37:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:37:30,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 07:37:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 07:37:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:37:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat