./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d8441fc60171cc197e6941bd5dc3cc65ef17dd7c903513ca4a8e24090c4956dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:22:40,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:22:40,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:22:40,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:22:40,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:22:40,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:22:40,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:22:40,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:22:40,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:22:40,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:22:40,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:22:40,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:22:40,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:22:40,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:22:40,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:22:40,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:22:40,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:22:40,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:22:40,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:22:40,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:22:40,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:22:40,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:22:40,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8441fc60171cc197e6941bd5dc3cc65ef17dd7c903513ca4a8e24090c4956dc [2025-03-08 09:22:40,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:22:40,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:22:40,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:22:40,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:22:40,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:22:40,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c [2025-03-08 09:22:41,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcafa7ac/96df1fcf00064175a6617a6d06eb7655/FLAG58d645dba [2025-03-08 09:22:42,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:22:42,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c [2025-03-08 09:22:42,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcafa7ac/96df1fcf00064175a6617a6d06eb7655/FLAG58d645dba [2025-03-08 09:22:42,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcafa7ac/96df1fcf00064175a6617a6d06eb7655 [2025-03-08 09:22:42,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:22:42,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:22:42,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:22:42,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:22:42,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:22:42,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:22:42" (1/1) ... [2025-03-08 09:22:42,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48531b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:42, skipping insertion in model container [2025-03-08 09:22:42,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:22:42" (1/1) ... [2025-03-08 09:22:42,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:22:42,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c[1177,1190] [2025-03-08 09:22:42,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:22:42,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:22:42,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.1.prop3-func-interl.c[1177,1190] [2025-03-08 09:22:43,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:22:43,028 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:22:43,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43 WrapperNode [2025-03-08 09:22:43,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:22:43,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:22:43,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:22:43,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:22:43,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,458 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5250 [2025-03-08 09:22:43,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:22:43,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:22:43,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:22:43,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:22:43,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:22:43,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:22:43,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:22:43,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:22:43,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:22:43,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (1/1) ... [2025-03-08 09:22:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:22:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:22:44,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:22:44,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:22:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:22:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:22:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:22:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:22:44,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:22:44,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:22:48,477 INFO L? ?]: Removed 2910 outVars from TransFormulas that were not future-live. [2025-03-08 09:22:48,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:22:48,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:22:48,682 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-08 09:22:48,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:22:48 BoogieIcfgContainer [2025-03-08 09:22:48,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:22:48,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:22:48,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:22:48,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:22:48,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:22:42" (1/3) ... [2025-03-08 09:22:48,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50831226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:22:48, skipping insertion in model container [2025-03-08 09:22:48,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:22:43" (2/3) ... [2025-03-08 09:22:48,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50831226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:22:48, skipping insertion in model container [2025-03-08 09:22:48,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:22:48" (3/3) ... [2025-03-08 09:22:48,690 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.resistance.1.prop3-func-interl.c [2025-03-08 09:22:48,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:22:48,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.resistance.1.prop3-func-interl.c that has 1 procedures, 1875 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:22:48,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:22:48,793 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;@1a0ce318, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:22:48,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:22:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 1875 states, 1873 states have (on average 1.5002669514148426) internal successors, (2810), 1874 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 09:22:48,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:48,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:48,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1157071864, now seen corresponding path program 1 times [2025-03-08 09:22:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378165167] [2025-03-08 09:22:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:48,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:48,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 09:22:48,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 09:22:48,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:49,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378165167] [2025-03-08 09:22:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378165167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:49,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:49,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:22:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383515085] [2025-03-08 09:22:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:49,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:22:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:22:49,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:49,607 INFO L87 Difference]: Start difference. First operand has 1875 states, 1873 states have (on average 1.5002669514148426) internal successors, (2810), 1874 states have internal predecessors, (2810), 0 states have call successors, (0), 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 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:50,497 INFO L93 Difference]: Finished difference Result 3647 states and 5469 transitions. [2025-03-08 09:22:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:22:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-08 09:22:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:50,512 INFO L225 Difference]: With dead ends: 3647 [2025-03-08 09:22:50,512 INFO L226 Difference]: Without dead ends: 1874 [2025-03-08 09:22:50,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:50,518 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 0 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7006 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:50,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7006 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 09:22:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-03-08 09:22:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2025-03-08 09:22:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 1.4991991457554725) internal successors, (2808), 1873 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2808 transitions. [2025-03-08 09:22:50,602 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2808 transitions. Word has length 103 [2025-03-08 09:22:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:50,602 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2808 transitions. [2025-03-08 09:22:50,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2808 transitions. [2025-03-08 09:22:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 09:22:50,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:50,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:22:50,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:50,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1504807361, now seen corresponding path program 1 times [2025-03-08 09:22:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:50,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842688928] [2025-03-08 09:22:50,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:50,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 09:22:50,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 09:22:50,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:50,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:50,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842688928] [2025-03-08 09:22:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842688928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:50,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:50,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:22:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495905646] [2025-03-08 09:22:50,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:22:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:22:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:50,916 INFO L87 Difference]: Start difference. First operand 1874 states and 2808 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:51,606 INFO L93 Difference]: Finished difference Result 3648 states and 5467 transitions. [2025-03-08 09:22:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:22:51,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-08 09:22:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:51,613 INFO L225 Difference]: With dead ends: 3648 [2025-03-08 09:22:51,613 INFO L226 Difference]: Without dead ends: 1876 [2025-03-08 09:22:51,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:51,615 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 0 mSDsluCounter, 4666 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7003 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:51,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7003 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:22:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-03-08 09:22:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1876. [2025-03-08 09:22:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1875 states have (on average 1.4986666666666666) internal successors, (2810), 1875 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2810 transitions. [2025-03-08 09:22:51,643 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2810 transitions. Word has length 104 [2025-03-08 09:22:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:51,643 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2810 transitions. [2025-03-08 09:22:51,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2810 transitions. [2025-03-08 09:22:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 09:22:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:51,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:22:51,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1767843101, now seen corresponding path program 1 times [2025-03-08 09:22:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64740124] [2025-03-08 09:22:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:51,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 09:22:51,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 09:22:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64740124] [2025-03-08 09:22:51,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64740124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:51,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:51,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:22:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46657500] [2025-03-08 09:22:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:51,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:22:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:51,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:22:51,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:22:51,848 INFO L87 Difference]: Start difference. First operand 1876 states and 2810 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:52,680 INFO L93 Difference]: Finished difference Result 3656 states and 5477 transitions. [2025-03-08 09:22:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:22:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-08 09:22:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:52,686 INFO L225 Difference]: With dead ends: 3656 [2025-03-08 09:22:52,687 INFO L226 Difference]: Without dead ends: 1882 [2025-03-08 09:22:52,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:22:52,689 INFO L435 NwaCegarLoop]: 2336 mSDtfsCounter, 4 mSDsluCounter, 6998 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:52,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9334 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 09:22:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-03-08 09:22:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2025-03-08 09:22:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1881 states have (on average 1.4981392876129718) internal successors, (2818), 1881 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2818 transitions. [2025-03-08 09:22:52,717 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2818 transitions. Word has length 105 [2025-03-08 09:22:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2818 transitions. [2025-03-08 09:22:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2818 transitions. [2025-03-08 09:22:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 09:22:52,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:52,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:52,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:22:52,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:52,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash 110516681, now seen corresponding path program 1 times [2025-03-08 09:22:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998336214] [2025-03-08 09:22:52,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:52,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 09:22:52,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 09:22:52,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:52,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:52,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998336214] [2025-03-08 09:22:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998336214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:22:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332179297] [2025-03-08 09:22:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:22:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:22:52,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:52,892 INFO L87 Difference]: Start difference. First operand 1882 states and 2818 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:53,568 INFO L93 Difference]: Finished difference Result 3664 states and 5487 transitions. [2025-03-08 09:22:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:22:53,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-08 09:22:53,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:53,574 INFO L225 Difference]: With dead ends: 3664 [2025-03-08 09:22:53,574 INFO L226 Difference]: Without dead ends: 1884 [2025-03-08 09:22:53,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:53,576 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 0 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6998 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:53,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6998 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:22:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-03-08 09:22:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2025-03-08 09:22:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 1.4976101964949549) internal successors, (2820), 1883 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2820 transitions. [2025-03-08 09:22:53,604 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2820 transitions. Word has length 106 [2025-03-08 09:22:53,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:53,604 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2820 transitions. [2025-03-08 09:22:53,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2820 transitions. [2025-03-08 09:22:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 09:22:53,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:53,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:22:53,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1539595106, now seen corresponding path program 1 times [2025-03-08 09:22:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:53,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147281156] [2025-03-08 09:22:53,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:53,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 09:22:53,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 09:22:53,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:53,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147281156] [2025-03-08 09:22:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147281156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:22:53,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112279888] [2025-03-08 09:22:53,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:22:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:22:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:53,780 INFO L87 Difference]: Start difference. First operand 1884 states and 2820 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:54,452 INFO L93 Difference]: Finished difference Result 3670 states and 5493 transitions. [2025-03-08 09:22:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:22:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-08 09:22:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:54,459 INFO L225 Difference]: With dead ends: 3670 [2025-03-08 09:22:54,459 INFO L226 Difference]: Without dead ends: 1888 [2025-03-08 09:22:54,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:22:54,462 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 0 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6998 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:54,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6998 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:22:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-03-08 09:22:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1884. [2025-03-08 09:22:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 1.4976101964949549) internal successors, (2820), 1883 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2820 transitions. [2025-03-08 09:22:54,491 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2820 transitions. Word has length 107 [2025-03-08 09:22:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:54,491 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2820 transitions. [2025-03-08 09:22:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2820 transitions. [2025-03-08 09:22:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 09:22:54,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:54,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:54,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:22:54,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:54,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1405557385, now seen corresponding path program 1 times [2025-03-08 09:22:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:54,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66908579] [2025-03-08 09:22:54,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 09:22:54,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 09:22:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66908579] [2025-03-08 09:22:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66908579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:54,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:22:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389683079] [2025-03-08 09:22:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:54,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:22:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:54,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:22:54,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:22:54,947 INFO L87 Difference]: Start difference. First operand 1884 states and 2820 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:56,128 INFO L93 Difference]: Finished difference Result 3674 states and 5499 transitions. [2025-03-08 09:22:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:22:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-08 09:22:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:56,133 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 09:22:56,133 INFO L226 Difference]: Without dead ends: 1892 [2025-03-08 09:22:56,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:22:56,135 INFO L435 NwaCegarLoop]: 2333 mSDtfsCounter, 2727 mSDsluCounter, 9309 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 11642 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:56,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 11642 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 09:22:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-03-08 09:22:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1888. [2025-03-08 09:22:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.4976152623211447) internal successors, (2826), 1887 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2826 transitions. [2025-03-08 09:22:56,161 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2826 transitions. Word has length 108 [2025-03-08 09:22:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:56,161 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2826 transitions. [2025-03-08 09:22:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2826 transitions. [2025-03-08 09:22:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 09:22:56,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:56,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:56,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:22:56,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1297417319, now seen corresponding path program 1 times [2025-03-08 09:22:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401291942] [2025-03-08 09:22:56,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:56,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 09:22:56,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 09:22:56,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:56,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401291942] [2025-03-08 09:22:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401291942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:22:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234698121] [2025-03-08 09:22:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:22:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:56,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:22:56,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:22:56,560 INFO L87 Difference]: Start difference. First operand 1888 states and 2826 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:57,642 INFO L93 Difference]: Finished difference Result 5054 states and 7567 transitions. [2025-03-08 09:22:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:22:57,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 09:22:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:57,653 INFO L225 Difference]: With dead ends: 5054 [2025-03-08 09:22:57,654 INFO L226 Difference]: Without dead ends: 3268 [2025-03-08 09:22:57,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:22:57,659 INFO L435 NwaCegarLoop]: 2329 mSDtfsCounter, 2129 mSDsluCounter, 6856 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 9185 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:57,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 9185 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:22:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2025-03-08 09:22:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 1969. [2025-03-08 09:22:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.497459349593496) internal successors, (2947), 1968 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2947 transitions. [2025-03-08 09:22:57,697 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2947 transitions. Word has length 109 [2025-03-08 09:22:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:57,697 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2947 transitions. [2025-03-08 09:22:57,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2947 transitions. [2025-03-08 09:22:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2025-03-08 09:22:57,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:57,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:57,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:22:57,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:57,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2072294177, now seen corresponding path program 1 times [2025-03-08 09:22:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:57,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235624529] [2025-03-08 09:22:57,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:57,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 984 statements into 1 equivalence classes. [2025-03-08 09:22:58,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 984 of 984 statements. [2025-03-08 09:22:58,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:22:58,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:22:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:22:59,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:22:59,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235624529] [2025-03-08 09:22:59,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235624529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:22:59,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:22:59,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:22:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31599420] [2025-03-08 09:22:59,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:22:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:22:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:22:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:22:59,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:22:59,299 INFO L87 Difference]: Start difference. First operand 1969 states and 2947 transitions. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:22:59,807 INFO L93 Difference]: Finished difference Result 3756 states and 5623 transitions. [2025-03-08 09:22:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:22:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 984 [2025-03-08 09:22:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:22:59,813 INFO L225 Difference]: With dead ends: 3756 [2025-03-08 09:22:59,813 INFO L226 Difference]: Without dead ends: 1970 [2025-03-08 09:22:59,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:22:59,816 INFO L435 NwaCegarLoop]: 2338 mSDtfsCounter, 0 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4671 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:22:59,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4671 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:22:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-08 09:22:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2025-03-08 09:22:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1969 states have (on average 1.4972067039106145) internal successors, (2948), 1969 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2948 transitions. [2025-03-08 09:22:59,841 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2948 transitions. Word has length 984 [2025-03-08 09:22:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:22:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2948 transitions. [2025-03-08 09:22:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:22:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2948 transitions. [2025-03-08 09:22:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2025-03-08 09:22:59,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:22:59,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:22:59,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:22:59,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:22:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:22:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 459797918, now seen corresponding path program 1 times [2025-03-08 09:22:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:22:59,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705326140] [2025-03-08 09:22:59,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:22:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:22:59,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 984 statements into 1 equivalence classes. [2025-03-08 09:23:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 984 of 984 statements. [2025-03-08 09:23:00,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:01,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705326140] [2025-03-08 09:23:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705326140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:23:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:23:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997877719] [2025-03-08 09:23:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:01,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:23:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:01,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:23:01,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:23:01,391 INFO L87 Difference]: Start difference. First operand 1970 states and 2948 transitions. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:01,898 INFO L93 Difference]: Finished difference Result 3758 states and 5625 transitions. [2025-03-08 09:23:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:23:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 984 [2025-03-08 09:23:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:01,903 INFO L225 Difference]: With dead ends: 3758 [2025-03-08 09:23:01,903 INFO L226 Difference]: Without dead ends: 1971 [2025-03-08 09:23:01,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:23:01,906 INFO L435 NwaCegarLoop]: 2338 mSDtfsCounter, 0 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4671 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:01,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4671 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:23:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2025-03-08 09:23:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1971. [2025-03-08 09:23:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1970 states have (on average 1.4969543147208122) internal successors, (2949), 1970 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2949 transitions. [2025-03-08 09:23:01,929 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2949 transitions. Word has length 984 [2025-03-08 09:23:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:01,929 INFO L471 AbstractCegarLoop]: Abstraction has 1971 states and 2949 transitions. [2025-03-08 09:23:01,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2949 transitions. [2025-03-08 09:23:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2025-03-08 09:23:01,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:01,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 09:23:01,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1797265693, now seen corresponding path program 1 times [2025-03-08 09:23:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250307591] [2025-03-08 09:23:01,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:02,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 984 statements into 1 equivalence classes. [2025-03-08 09:23:02,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 984 of 984 statements. [2025-03-08 09:23:02,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:02,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:04,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250307591] [2025-03-08 09:23:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250307591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063773035] [2025-03-08 09:23:04,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:04,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:04,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:04,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:23:04,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 984 statements into 1 equivalence classes. [2025-03-08 09:23:05,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 984 of 984 statements. [2025-03-08 09:23:05,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:05,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:05,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 4264 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 09:23:05,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:07,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:23:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063773035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:23:08,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:23:08,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-03-08 09:23:08,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88239889] [2025-03-08 09:23:08,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:23:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 09:23:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:08,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 09:23:08,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:23:08,583 INFO L87 Difference]: Start difference. First operand 1971 states and 2949 transitions. Second operand has 15 states, 15 states have (on average 136.4) internal successors, (2046), 15 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:11,878 INFO L93 Difference]: Finished difference Result 13720 states and 20549 transitions. [2025-03-08 09:23:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 09:23:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 136.4) internal successors, (2046), 15 states have internal predecessors, (2046), 0 states have call successors, (0), 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 984 [2025-03-08 09:23:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:11,903 INFO L225 Difference]: With dead ends: 13720 [2025-03-08 09:23:11,903 INFO L226 Difference]: Without dead ends: 8881 [2025-03-08 09:23:11,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1997 GetRequests, 1962 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 09:23:11,911 INFO L435 NwaCegarLoop]: 2290 mSDtfsCounter, 40471 mSDsluCounter, 17744 mSDsCounter, 0 mSdLazyCounter, 5565 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40471 SdHoareTripleChecker+Valid, 20034 SdHoareTripleChecker+Invalid, 5755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 5565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:11,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40471 Valid, 20034 Invalid, 5755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 5565 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 09:23:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2025-03-08 09:23:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 3477. [2025-03-08 09:23:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 3476 states have (on average 1.4974108170310703) internal successors, (5205), 3476 states have internal predecessors, (5205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5205 transitions. [2025-03-08 09:23:11,985 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5205 transitions. Word has length 984 [2025-03-08 09:23:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5205 transitions. [2025-03-08 09:23:11,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 136.4) internal successors, (2046), 15 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5205 transitions. [2025-03-08 09:23:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2025-03-08 09:23:11,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:11,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:23:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 09:23:12,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:12,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:12,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1553616137, now seen corresponding path program 1 times [2025-03-08 09:23:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670948486] [2025-03-08 09:23:12,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:12,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 986 statements into 1 equivalence classes. [2025-03-08 09:23:12,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 986 of 986 statements. [2025-03-08 09:23:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670948486] [2025-03-08 09:23:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670948486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:23:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:23:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72293211] [2025-03-08 09:23:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:23:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:23:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:23:13,447 INFO L87 Difference]: Start difference. First operand 3477 states and 5205 transitions. Second operand has 5 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:14,505 INFO L93 Difference]: Finished difference Result 6765 states and 10130 transitions. [2025-03-08 09:23:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:23:14,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 0 states have call successors, (0), 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 986 [2025-03-08 09:23:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:14,511 INFO L225 Difference]: With dead ends: 6765 [2025-03-08 09:23:14,511 INFO L226 Difference]: Without dead ends: 3479 [2025-03-08 09:23:14,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:23:14,514 INFO L435 NwaCegarLoop]: 1850 mSDtfsCounter, 2679 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2679 SdHoareTripleChecker+Valid, 5542 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:14,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2679 Valid, 5542 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:23:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2025-03-08 09:23:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3479. [2025-03-08 09:23:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.497124784358827) internal successors, (5207), 3478 states have internal predecessors, (5207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5207 transitions. [2025-03-08 09:23:14,552 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5207 transitions. Word has length 986 [2025-03-08 09:23:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:14,553 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 5207 transitions. [2025-03-08 09:23:14,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5207 transitions. [2025-03-08 09:23:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2025-03-08 09:23:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:14,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:23:14,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1013652991, now seen corresponding path program 1 times [2025-03-08 09:23:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524951953] [2025-03-08 09:23:14,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:14,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-08 09:23:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-08 09:23:14,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:14,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:15,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524951953] [2025-03-08 09:23:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524951953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:23:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:23:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036902538] [2025-03-08 09:23:15,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:15,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:23:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:15,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:23:15,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:23:15,562 INFO L87 Difference]: Start difference. First operand 3479 states and 5207 transitions. Second operand has 4 states, 4 states have (on average 246.75) internal successors, (987), 4 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:16,063 INFO L93 Difference]: Finished difference Result 6769 states and 10134 transitions. [2025-03-08 09:23:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:23:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 246.75) internal successors, (987), 4 states have internal predecessors, (987), 0 states have call successors, (0), 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 987 [2025-03-08 09:23:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:16,069 INFO L225 Difference]: With dead ends: 6769 [2025-03-08 09:23:16,069 INFO L226 Difference]: Without dead ends: 3481 [2025-03-08 09:23:16,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:23:16,071 INFO L435 NwaCegarLoop]: 2337 mSDtfsCounter, 0 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6998 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:16,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6998 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:23:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3481 states. [2025-03-08 09:23:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3481 to 3481. [2025-03-08 09:23:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 3480 states have (on average 1.4968390804597702) internal successors, (5209), 3480 states have internal predecessors, (5209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5209 transitions. [2025-03-08 09:23:16,101 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5209 transitions. Word has length 987 [2025-03-08 09:23:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:16,101 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 5209 transitions. [2025-03-08 09:23:16,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 246.75) internal successors, (987), 4 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5209 transitions. [2025-03-08 09:23:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2025-03-08 09:23:16,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:16,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:16,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:23:16,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:16,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -202316686, now seen corresponding path program 1 times [2025-03-08 09:23:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139629376] [2025-03-08 09:23:16,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 988 statements into 1 equivalence classes. [2025-03-08 09:23:16,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 988 of 988 statements. [2025-03-08 09:23:16,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 09:23:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139629376] [2025-03-08 09:23:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139629376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88335985] [2025-03-08 09:23:18,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:18,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:18,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:18,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:18,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:23:19,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 988 statements into 1 equivalence classes. [2025-03-08 09:23:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 988 of 988 statements. [2025-03-08 09:23:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:19,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 4276 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 09:23:19,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:22,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:23:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88335985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:23:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 09:23:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925153284] [2025-03-08 09:23:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:22,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:23:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:22,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:23:22,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:23:22,388 INFO L87 Difference]: Start difference. First operand 3481 states and 5209 transitions. Second operand has 5 states, 5 states have (on average 197.6) internal successors, (988), 5 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:24,153 INFO L93 Difference]: Finished difference Result 9845 states and 14741 transitions. [2025-03-08 09:23:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:23:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 197.6) internal successors, (988), 5 states have internal predecessors, (988), 0 states have call successors, (0), 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 988 [2025-03-08 09:23:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:24,164 INFO L225 Difference]: With dead ends: 9845 [2025-03-08 09:23:24,164 INFO L226 Difference]: Without dead ends: 6555 [2025-03-08 09:23:24,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 986 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:23:24,168 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 1671 mSDsluCounter, 5662 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 7649 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:24,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 7649 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 09:23:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6555 states. [2025-03-08 09:23:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6555 to 6551. [2025-03-08 09:23:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6551 states, 6550 states have (on average 1.4972519083969467) internal successors, (9807), 6550 states have internal predecessors, (9807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 9807 transitions. [2025-03-08 09:23:24,234 INFO L78 Accepts]: Start accepts. Automaton has 6551 states and 9807 transitions. Word has length 988 [2025-03-08 09:23:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:24,236 INFO L471 AbstractCegarLoop]: Abstraction has 6551 states and 9807 transitions. [2025-03-08 09:23:24,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.6) internal successors, (988), 5 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6551 states and 9807 transitions. [2025-03-08 09:23:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2025-03-08 09:23:24,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:24,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:24,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:23:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 09:23:24,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -332337090, now seen corresponding path program 1 times [2025-03-08 09:23:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634955577] [2025-03-08 09:23:24,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:24,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 989 statements into 1 equivalence classes. [2025-03-08 09:23:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 989 of 989 statements. [2025-03-08 09:23:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 09:23:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634955577] [2025-03-08 09:23:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634955577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310364939] [2025-03-08 09:23:26,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:26,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:26,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:26,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:26,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:23:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 989 statements into 1 equivalence classes. [2025-03-08 09:23:27,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 989 of 989 statements. [2025-03-08 09:23:27,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:27,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:27,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 4279 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 09:23:27,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:28,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:23:28,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310364939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:28,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:23:28,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-08 09:23:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349669752] [2025-03-08 09:23:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:28,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:23:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:28,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:23:28,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:23:28,585 INFO L87 Difference]: Start difference. First operand 6551 states and 9807 transitions. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:30,591 INFO L93 Difference]: Finished difference Result 14573 states and 21821 transitions. [2025-03-08 09:23:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:23:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 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 989 [2025-03-08 09:23:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:30,602 INFO L225 Difference]: With dead ends: 14573 [2025-03-08 09:23:30,602 INFO L226 Difference]: Without dead ends: 8213 [2025-03-08 09:23:30,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 986 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:23:30,608 INFO L435 NwaCegarLoop]: 2677 mSDtfsCounter, 3700 mSDsluCounter, 7167 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 9844 SdHoareTripleChecker+Invalid, 5099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:30,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3700 Valid, 9844 Invalid, 5099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 09:23:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8213 states. [2025-03-08 09:23:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8213 to 7479. [2025-03-08 09:23:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 7478 states have (on average 1.4967905857181065) internal successors, (11193), 7478 states have internal predecessors, (11193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 11193 transitions. [2025-03-08 09:23:30,669 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 11193 transitions. Word has length 989 [2025-03-08 09:23:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:30,669 INFO L471 AbstractCegarLoop]: Abstraction has 7479 states and 11193 transitions. [2025-03-08 09:23:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 11193 transitions. [2025-03-08 09:23:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2025-03-08 09:23:30,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:30,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:30,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:23:30,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:30,879 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 900433294, now seen corresponding path program 1 times [2025-03-08 09:23:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331387309] [2025-03-08 09:23:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:30,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-08 09:23:31,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-08 09:23:31,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:31,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 09:23:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331387309] [2025-03-08 09:23:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331387309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027146100] [2025-03-08 09:23:33,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:33,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:33,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:33,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:33,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 09:23:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-08 09:23:33,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-08 09:23:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:33,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:33,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 4282 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 09:23:34,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:35,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:23:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027146100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:23:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2025-03-08 09:23:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293710626] [2025-03-08 09:23:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:35,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 09:23:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:35,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 09:23:35,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:23:35,955 INFO L87 Difference]: Start difference. First operand 7479 states and 11193 transitions. Second operand has 11 states, 11 states have (on average 90.0) internal successors, (990), 11 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:40,471 INFO L93 Difference]: Finished difference Result 17353 states and 25979 transitions. [2025-03-08 09:23:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:23:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.0) internal successors, (990), 11 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 990 [2025-03-08 09:23:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:40,487 INFO L225 Difference]: With dead ends: 17353 [2025-03-08 09:23:40,487 INFO L226 Difference]: Without dead ends: 10065 [2025-03-08 09:23:40,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 995 GetRequests, 982 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:23:40,496 INFO L435 NwaCegarLoop]: 3187 mSDtfsCounter, 3967 mSDsluCounter, 24097 mSDsCounter, 0 mSdLazyCounter, 13333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3967 SdHoareTripleChecker+Valid, 27284 SdHoareTripleChecker+Invalid, 13336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:40,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3967 Valid, 27284 Invalid, 13336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 13333 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 09:23:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10065 states. [2025-03-08 09:23:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10065 to 10047. [2025-03-08 09:23:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10047 states, 10046 states have (on average 1.4970137368106708) internal successors, (15039), 10046 states have internal predecessors, (15039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10047 states to 10047 states and 15039 transitions. [2025-03-08 09:23:40,577 INFO L78 Accepts]: Start accepts. Automaton has 10047 states and 15039 transitions. Word has length 990 [2025-03-08 09:23:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:40,578 INFO L471 AbstractCegarLoop]: Abstraction has 10047 states and 15039 transitions. [2025-03-08 09:23:40,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.0) internal successors, (990), 11 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10047 states and 15039 transitions. [2025-03-08 09:23:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 992 [2025-03-08 09:23:40,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:40,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:40,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 09:23:40,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 09:23:40,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:40,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash -203137315, now seen corresponding path program 1 times [2025-03-08 09:23:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917573791] [2025-03-08 09:23:40,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:40,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:40,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 991 statements into 1 equivalence classes. [2025-03-08 09:23:41,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 991 of 991 statements. [2025-03-08 09:23:41,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:41,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 09:23:43,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917573791] [2025-03-08 09:23:43,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917573791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042359258] [2025-03-08 09:23:43,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:43,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:43,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:43,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 09:23:43,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 991 statements into 1 equivalence classes. [2025-03-08 09:23:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 991 of 991 statements. [2025-03-08 09:23:44,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:44,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:44,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 4285 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-08 09:23:44,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 09:23:44,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:23:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042359258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:44,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:23:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 09:23:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413936273] [2025-03-08 09:23:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:23:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:44,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:23:44,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:23:44,611 INFO L87 Difference]: Start difference. First operand 10047 states and 15039 transitions. Second operand has 5 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:45,672 INFO L93 Difference]: Finished difference Result 19907 states and 29799 transitions. [2025-03-08 09:23:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:23:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 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 991 [2025-03-08 09:23:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:45,684 INFO L225 Difference]: With dead ends: 19907 [2025-03-08 09:23:45,684 INFO L226 Difference]: Without dead ends: 10047 [2025-03-08 09:23:45,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 989 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:23:45,695 INFO L435 NwaCegarLoop]: 1846 mSDtfsCounter, 2716 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 4896 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:45,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2716 Valid, 4896 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:23:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10047 states. [2025-03-08 09:23:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10047 to 10047. [2025-03-08 09:23:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10047 states, 10046 states have (on average 1.4964164841728052) internal successors, (15033), 10046 states have internal predecessors, (15033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10047 states to 10047 states and 15033 transitions. [2025-03-08 09:23:45,794 INFO L78 Accepts]: Start accepts. Automaton has 10047 states and 15033 transitions. Word has length 991 [2025-03-08 09:23:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:45,794 INFO L471 AbstractCegarLoop]: Abstraction has 10047 states and 15033 transitions. [2025-03-08 09:23:45,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10047 states and 15033 transitions. [2025-03-08 09:23:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2025-03-08 09:23:45,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:45,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:45,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 09:23:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 09:23:46,006 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1706364490, now seen corresponding path program 1 times [2025-03-08 09:23:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36544601] [2025-03-08 09:23:46,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:46,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 994 statements into 1 equivalence classes. [2025-03-08 09:23:46,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 994 of 994 statements. [2025-03-08 09:23:46,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:46,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 09:23:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36544601] [2025-03-08 09:23:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36544601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:23:48,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308386124] [2025-03-08 09:23:48,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:48,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:23:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:23:48,425 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:23:48,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 09:23:48,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 994 statements into 1 equivalence classes. [2025-03-08 09:23:49,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 994 of 994 statements. [2025-03-08 09:23:49,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:49,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:49,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 4290 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 09:23:49,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:23:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:52,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:23:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308386124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:23:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5] total 21 [2025-03-08 09:23:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246949924] [2025-03-08 09:23:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 09:23:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:52,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 09:23:52,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-08 09:23:52,149 INFO L87 Difference]: Start difference. First operand 10047 states and 15033 transitions. Second operand has 18 states, 18 states have (on average 55.22222222222222) internal successors, (994), 18 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:54,507 INFO L93 Difference]: Finished difference Result 46073 states and 68985 transitions. [2025-03-08 09:23:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 09:23:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 55.22222222222222) internal successors, (994), 18 states have internal predecessors, (994), 0 states have call successors, (0), 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 994 [2025-03-08 09:23:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:54,544 INFO L225 Difference]: With dead ends: 46073 [2025-03-08 09:23:54,544 INFO L226 Difference]: Without dead ends: 36217 [2025-03-08 09:23:54,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 979 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:23:54,565 INFO L435 NwaCegarLoop]: 3341 mSDtfsCounter, 7724 mSDsluCounter, 26392 mSDsCounter, 0 mSdLazyCounter, 6279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7724 SdHoareTripleChecker+Valid, 29733 SdHoareTripleChecker+Invalid, 6281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:54,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7724 Valid, 29733 Invalid, 6281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 09:23:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36217 states. [2025-03-08 09:23:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36217 to 15839. [2025-03-08 09:23:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15839 states, 15838 states have (on average 1.4963379214547292) internal successors, (23699), 15838 states have internal predecessors, (23699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15839 states to 15839 states and 23699 transitions. [2025-03-08 09:23:54,785 INFO L78 Accepts]: Start accepts. Automaton has 15839 states and 23699 transitions. Word has length 994 [2025-03-08 09:23:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:54,786 INFO L471 AbstractCegarLoop]: Abstraction has 15839 states and 23699 transitions. [2025-03-08 09:23:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 55.22222222222222) internal successors, (994), 18 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15839 states and 23699 transitions. [2025-03-08 09:23:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2025-03-08 09:23:54,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:54,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:54,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 09:23:55,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 09:23:55,001 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:55,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash -637143997, now seen corresponding path program 1 times [2025-03-08 09:23:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319854838] [2025-03-08 09:23:55,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 995 statements into 1 equivalence classes. [2025-03-08 09:23:55,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 995 of 995 statements. [2025-03-08 09:23:55,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:55,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:23:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:23:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:23:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319854838] [2025-03-08 09:23:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319854838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:23:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:23:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:23:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202913571] [2025-03-08 09:23:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:23:55,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:23:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:23:55,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:23:55,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:23:55,984 INFO L87 Difference]: Start difference. First operand 15839 states and 23699 transitions. Second operand has 4 states, 4 states have (on average 248.75) internal successors, (995), 4 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:23:56,502 INFO L93 Difference]: Finished difference Result 31519 states and 47165 transitions. [2025-03-08 09:23:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:23:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 248.75) internal successors, (995), 4 states have internal predecessors, (995), 0 states have call successors, (0), 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 995 [2025-03-08 09:23:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:23:56,518 INFO L225 Difference]: With dead ends: 31519 [2025-03-08 09:23:56,518 INFO L226 Difference]: Without dead ends: 15871 [2025-03-08 09:23:56,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:23:56,531 INFO L435 NwaCegarLoop]: 2335 mSDtfsCounter, 0 mSDsluCounter, 4657 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:23:56,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6992 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:23:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15871 states. [2025-03-08 09:23:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15871 to 15871. [2025-03-08 09:23:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15871 states, 15870 states have (on average 1.4953371140516698) internal successors, (23731), 15870 states have internal predecessors, (23731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15871 states to 15871 states and 23731 transitions. [2025-03-08 09:23:56,663 INFO L78 Accepts]: Start accepts. Automaton has 15871 states and 23731 transitions. Word has length 995 [2025-03-08 09:23:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:23:56,664 INFO L471 AbstractCegarLoop]: Abstraction has 15871 states and 23731 transitions. [2025-03-08 09:23:56,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 248.75) internal successors, (995), 4 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:23:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15871 states and 23731 transitions. [2025-03-08 09:23:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2025-03-08 09:23:56,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:23:56,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:23:56,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:23:56,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:23:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:23:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1738147808, now seen corresponding path program 1 times [2025-03-08 09:23:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:23:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906084695] [2025-03-08 09:23:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:23:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:23:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 995 statements into 1 equivalence classes. [2025-03-08 09:23:57,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 995 of 995 statements. [2025-03-08 09:23:57,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:23:57,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat