./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:18:19,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:18:19,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:18:19,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:18:19,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:18:19,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:18:19,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:18:19,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:18:19,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:18:19,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:18:19,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:18:19,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:18:19,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:18:19,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:18:19,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:18:19,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:18:19,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:18:19,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:18:19,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:18:19,307 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 [2025-03-03 21:18:19,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:18:19,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:18:19,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:18:19,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:18:19,535 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:18:19,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-03 21:18:20,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304a2cbaf/54ec6418f6354bf6bafbc33d60ca011d/FLAG08f8e6980 [2025-03-03 21:18:20,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:18:20,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-03 21:18:20,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304a2cbaf/54ec6418f6354bf6bafbc33d60ca011d/FLAG08f8e6980 [2025-03-03 21:18:21,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304a2cbaf/54ec6418f6354bf6bafbc33d60ca011d [2025-03-03 21:18:21,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:18:21,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:18:21,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:18:21,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:18:21,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:18:21,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21, skipping insertion in model container [2025-03-03 21:18:21,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:18:21,302 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i[919,932] [2025-03-03 21:18:21,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:18:21,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:18:21,392 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i[919,932] [2025-03-03 21:18:21,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:18:21,443 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:18:21,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21 WrapperNode [2025-03-03 21:18:21,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:18:21,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:18:21,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:18:21,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:18:21,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,478 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-03 21:18:21,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:18:21,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:18:21,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:18:21,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:18:21,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:18:21,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:18:21,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:18:21,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:18:21,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:18:21,519 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (1/1) ... [2025-03-03 21:18:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:18:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:18:21,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:18:21,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:18:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:18:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:18:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:18:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:18:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:18:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:18:21,644 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:18:21,645 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:18:21,926 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:18:21,926 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:18:21,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:18:21,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:18:21,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:18:21 BoogieIcfgContainer [2025-03-03 21:18:21,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:18:21,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:18:21,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:18:21,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:18:21,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:18:21" (1/3) ... [2025-03-03 21:18:21,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44732568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:18:21, skipping insertion in model container [2025-03-03 21:18:21,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:21" (2/3) ... [2025-03-03 21:18:21,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44732568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:18:21, skipping insertion in model container [2025-03-03 21:18:21,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:18:21" (3/3) ... [2025-03-03 21:18:21,944 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-03 21:18:21,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:18:21,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:18:21,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:18:22,005 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;@b2f1d21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:18:22,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:18:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:18:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:18:22,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:22,024 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:22,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:22,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1612159271, now seen corresponding path program 1 times [2025-03-03 21:18:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-03 21:18:22,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:22,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:18:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:18:22,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:22,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-03 21:18:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-03-03 21:18:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954689060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:18:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541414792] [2025-03-03 21:18:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:18:22,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:18:22,427 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-03 21:18:22,428 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-03 21:18:22,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:18:22,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:18:22,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:22,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:22,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:18:22,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:18:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-03 21:18:22,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:18:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541414792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:22,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:18:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:18:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14292558] [2025-03-03 21:18:22,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:22,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:18:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:22,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:18:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:18:22,676 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 21:18:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:22,706 INFO L93 Difference]: Finished difference Result 220 states and 401 transitions. [2025-03-03 21:18:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:18:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-03-03 21:18:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:22,712 INFO L225 Difference]: With dead ends: 220 [2025-03-03 21:18:22,712 INFO L226 Difference]: Without dead ends: 110 [2025-03-03 21:18:22,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:18:22,716 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:22,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:18:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-03 21:18:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-03 21:18:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 21:18:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 176 transitions. [2025-03-03 21:18:22,758 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 176 transitions. Word has length 270 [2025-03-03 21:18:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 176 transitions. [2025-03-03 21:18:22,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 21:18:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2025-03-03 21:18:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:18:22,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:22,765 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:22,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:18:22,965 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,SelfDestructingSolverStorable0 [2025-03-03 21:18:22,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:22,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1390424187, now seen corresponding path program 1 times [2025-03-03 21:18:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:22,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659662696] [2025-03-03 21:18:22,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:22,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:18:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:18:23,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:23,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:18:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659662696] [2025-03-03 21:18:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659662696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:18:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661447305] [2025-03-03 21:18:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:27,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:18:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:27,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:18:27,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:18:27,490 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:18:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:28,299 INFO L93 Difference]: Finished difference Result 378 states and 585 transitions. [2025-03-03 21:18:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:18:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:18:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:28,304 INFO L225 Difference]: With dead ends: 378 [2025-03-03 21:18:28,304 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 21:18:28,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:18:28,310 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 269 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:28,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1095 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:18:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 21:18:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2025-03-03 21:18:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 130 states have internal predecessors, (192), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:18:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 288 transitions. [2025-03-03 21:18:28,343 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 288 transitions. Word has length 270 [2025-03-03 21:18:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 288 transitions. [2025-03-03 21:18:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:18:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 288 transitions. [2025-03-03 21:18:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:18:28,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:28,349 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:28,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:18:28,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1389500666, now seen corresponding path program 1 times [2025-03-03 21:18:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618006511] [2025-03-03 21:18:28,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:28,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:18:28,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:18:28,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:28,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:18:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618006511] [2025-03-03 21:18:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618006511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:18:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527519213] [2025-03-03 21:18:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:18:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:57,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:18:57,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:18:57,207 INFO L87 Difference]: Start difference. First operand 180 states and 288 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:18:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:58,382 INFO L93 Difference]: Finished difference Result 245 states and 375 transitions. [2025-03-03 21:18:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:18:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:18:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:58,386 INFO L225 Difference]: With dead ends: 245 [2025-03-03 21:18:58,386 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 21:18:58,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:18:58,387 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 199 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:58,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1148 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:18:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 21:18:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 181. [2025-03-03 21:18:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 130 states have (on average 1.4846153846153847) internal successors, (193), 131 states have internal predecessors, (193), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:18:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2025-03-03 21:18:58,410 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 270 [2025-03-03 21:18:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2025-03-03 21:18:58,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:18:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2025-03-03 21:18:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:18:58,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:58,415 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:58,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:18:58,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:58,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1261341468, now seen corresponding path program 1 times [2025-03-03 21:18:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:58,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808869403] [2025-03-03 21:18:58,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:18:58,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:18:58,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:58,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808869403] [2025-03-03 21:19:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808869403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:01,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:19:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27200483] [2025-03-03 21:19:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:19:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:01,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:19:01,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:19:01,678 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:02,348 INFO L93 Difference]: Finished difference Result 271 states and 404 transitions. [2025-03-03 21:19:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:19:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:19:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:02,350 INFO L225 Difference]: With dead ends: 271 [2025-03-03 21:19:02,350 INFO L226 Difference]: Without dead ends: 269 [2025-03-03 21:19:02,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:19:02,351 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 264 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:02,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1382 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:19:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-03 21:19:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2025-03-03 21:19:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 139 states have internal predecessors, (206), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:19:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 302 transitions. [2025-03-03 21:19:02,369 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 302 transitions. Word has length 270 [2025-03-03 21:19:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:02,369 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 302 transitions. [2025-03-03 21:19:02,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 302 transitions. [2025-03-03 21:19:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:02,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:02,371 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:02,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:19:02,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1260417947, now seen corresponding path program 1 times [2025-03-03 21:19:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422289854] [2025-03-03 21:19:02,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:02,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:02,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:02,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:06,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422289854] [2025-03-03 21:19:06,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422289854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:06,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:06,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:19:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300223133] [2025-03-03 21:19:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:06,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:19:06,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:06,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:19:06,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:19:06,492 INFO L87 Difference]: Start difference. First operand 189 states and 302 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:07,366 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions. [2025-03-03 21:19:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:19:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:19:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:07,368 INFO L225 Difference]: With dead ends: 269 [2025-03-03 21:19:07,368 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 21:19:07,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:19:07,369 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 290 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:07,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1293 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:19:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 21:19:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 185. [2025-03-03 21:19:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 134 states have (on average 1.492537313432836) internal successors, (200), 135 states have internal predecessors, (200), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:19:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 296 transitions. [2025-03-03 21:19:07,387 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 296 transitions. Word has length 270 [2025-03-03 21:19:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 296 transitions. [2025-03-03 21:19:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2025-03-03 21:19:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:07,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:07,390 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:07,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:19:07,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:07,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1900958364, now seen corresponding path program 1 times [2025-03-03 21:19:07,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:07,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199133913] [2025-03-03 21:19:07,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:07,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:07,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:07,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:07,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:07,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199133913] [2025-03-03 21:19:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199133913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:07,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:19:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876000180] [2025-03-03 21:19:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:07,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:19:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:07,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:19:07,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:19:07,464 INFO L87 Difference]: Start difference. First operand 185 states and 296 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:07,503 INFO L93 Difference]: Finished difference Result 513 states and 824 transitions. [2025-03-03 21:19:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:19:07,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:19:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:07,506 INFO L225 Difference]: With dead ends: 513 [2025-03-03 21:19:07,506 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 21:19:07,507 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-03 21:19:07,508 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 162 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:07,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:19:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 21:19:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2025-03-03 21:19:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 228 states have (on average 1.4385964912280702) internal successors, (328), 230 states have internal predecessors, (328), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:19:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 520 transitions. [2025-03-03 21:19:07,532 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 520 transitions. Word has length 270 [2025-03-03 21:19:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:07,536 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 520 transitions. [2025-03-03 21:19:07,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2025-03-03 21:19:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:07,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:07,537 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:07,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:19:07,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:07,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 597057573, now seen corresponding path program 1 times [2025-03-03 21:19:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-03-03 21:19:07,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:07,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:07,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:07,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:07,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541777626] [2025-03-03 21:19:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541777626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:07,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:19:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895023299] [2025-03-03 21:19:07,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:07,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:19:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:07,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:19:07,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:19:07,641 INFO L87 Difference]: Start difference. First operand 329 states and 520 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:07,881 INFO L93 Difference]: Finished difference Result 957 states and 1498 transitions. [2025-03-03 21:19:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:19:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:19:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:07,886 INFO L225 Difference]: With dead ends: 957 [2025-03-03 21:19:07,886 INFO L226 Difference]: Without dead ends: 631 [2025-03-03 21:19:07,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:19:07,887 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 127 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:07,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 564 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:19:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-03 21:19:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 580. [2025-03-03 21:19:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 383 states have (on average 1.4099216710182767) internal successors, (540), 386 states have internal predecessors, (540), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-03 21:19:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 916 transitions. [2025-03-03 21:19:07,942 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 916 transitions. Word has length 270 [2025-03-03 21:19:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:07,942 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 916 transitions. [2025-03-03 21:19:07,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 916 transitions. [2025-03-03 21:19:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:07,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:07,944 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:19:07,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:07,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 726140292, now seen corresponding path program 1 times [2025-03-03 21:19:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014305023] [2025-03-03 21:19:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:07,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:08,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:08,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:08,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014305023] [2025-03-03 21:19:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014305023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:19:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668452367] [2025-03-03 21:19:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:10,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:19:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:10,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:19:10,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:19:10,057 INFO L87 Difference]: Start difference. First operand 580 states and 916 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:10,827 INFO L93 Difference]: Finished difference Result 749 states and 1124 transitions. [2025-03-03 21:19:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:19:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-03-03 21:19:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:10,833 INFO L225 Difference]: With dead ends: 749 [2025-03-03 21:19:10,833 INFO L226 Difference]: Without dead ends: 747 [2025-03-03 21:19:10,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:19:10,834 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 423 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:10,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1085 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:19:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-03 21:19:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 651. [2025-03-03 21:19:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 443 states have (on average 1.399548532731377) internal successors, (620), 448 states have internal predecessors, (620), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 21:19:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1012 transitions. [2025-03-03 21:19:10,886 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1012 transitions. Word has length 270 [2025-03-03 21:19:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1012 transitions. [2025-03-03 21:19:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-03 21:19:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1012 transitions. [2025-03-03 21:19:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:10,888 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:19:10,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 727063813, now seen corresponding path program 1 times [2025-03-03 21:19:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545832275] [2025-03-03 21:19:10,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:10,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545832275] [2025-03-03 21:19:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545832275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:14,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:14,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:19:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554011395] [2025-03-03 21:19:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:14,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:19:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:14,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:19:14,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:19:14,172 INFO L87 Difference]: Start difference. First operand 651 states and 1012 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 21:19:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:16,774 INFO L93 Difference]: Finished difference Result 747 states and 1122 transitions. [2025-03-03 21:19:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:19:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 270 [2025-03-03 21:19:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:16,778 INFO L225 Difference]: With dead ends: 747 [2025-03-03 21:19:16,779 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 21:19:16,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2025-03-03 21:19:16,781 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 474 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:16,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1294 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:19:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 21:19:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 651. [2025-03-03 21:19:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 443 states have (on average 1.399548532731377) internal successors, (620), 448 states have internal predecessors, (620), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 21:19:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1012 transitions. [2025-03-03 21:19:16,845 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1012 transitions. Word has length 270 [2025-03-03 21:19:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:16,845 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1012 transitions. [2025-03-03 21:19:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-03-03 21:19:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1012 transitions. [2025-03-03 21:19:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 21:19:16,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:16,847 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:16,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:19:16,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:16,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2060071238, now seen corresponding path program 1 times [2025-03-03 21:19:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477157841] [2025-03-03 21:19:16,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:16,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 21:19:16,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 21:19:16,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:16,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-03 21:19:17,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:17,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477157841] [2025-03-03 21:19:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477157841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:19:17,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:19:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:19:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174891537] [2025-03-03 21:19:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:19:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:19:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:17,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:19:17,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:19:17,147 INFO L87 Difference]: Start difference. First operand 651 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 21:19:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:17,394 INFO L93 Difference]: Finished difference Result 1197 states and 1843 transitions. [2025-03-03 21:19:17,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:19:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-03-03 21:19:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:17,400 INFO L225 Difference]: With dead ends: 1197 [2025-03-03 21:19:17,400 INFO L226 Difference]: Without dead ends: 638 [2025-03-03 21:19:17,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:19:17,402 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 222 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:17,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 332 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:19:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-03 21:19:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 623. [2025-03-03 21:19:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 409 states have (on average 1.3471882640586796) internal successors, (551), 414 states have internal predecessors, (551), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 21:19:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 951 transitions. [2025-03-03 21:19:17,452 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 951 transitions. Word has length 270 [2025-03-03 21:19:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:17,453 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 951 transitions. [2025-03-03 21:19:17,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-03 21:19:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 951 transitions. [2025-03-03 21:19:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 21:19:17,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:17,455 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:19:17,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2773143, now seen corresponding path program 1 times [2025-03-03 21:19:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875561242] [2025-03-03 21:19:17,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 21:19:17,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 21:19:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 84 proven. 45 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-03 21:19:21,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:21,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875561242] [2025-03-03 21:19:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875561242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:19:21,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829058401] [2025-03-03 21:19:21,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:21,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:19:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:19:21,312 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-03 21:19:21,312 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-03 21:19:21,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 21:19:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 21:19:21,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:21,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 21:19:21,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:19:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1796 proven. 84 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2025-03-03 21:19:22,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:19:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 168 proven. 87 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2025-03-03 21:19:22,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829058401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:19:22,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:19:22,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 26 [2025-03-03 21:19:22,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626695511] [2025-03-03 21:19:22,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:19:22,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 21:19:22,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:22,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 21:19:22,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:19:22,821 INFO L87 Difference]: Start difference. First operand 623 states and 951 transitions. Second operand has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) [2025-03-03 21:19:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:19:25,607 INFO L93 Difference]: Finished difference Result 2385 states and 3530 transitions. [2025-03-03 21:19:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 21:19:25,608 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) Word has length 271 [2025-03-03 21:19:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:19:25,617 INFO L225 Difference]: With dead ends: 2385 [2025-03-03 21:19:25,618 INFO L226 Difference]: Without dead ends: 1849 [2025-03-03 21:19:25,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 21:19:25,621 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 845 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:19:25,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1439 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 21:19:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2025-03-03 21:19:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 925. [2025-03-03 21:19:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 613 states have (on average 1.298531810766721) internal successors, (796), 626 states have internal predecessors, (796), 284 states have call successors, (284), 27 states have call predecessors, (284), 27 states have return successors, (284), 271 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-03 21:19:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1364 transitions. [2025-03-03 21:19:25,741 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1364 transitions. Word has length 271 [2025-03-03 21:19:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:19:25,742 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1364 transitions. [2025-03-03 21:19:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.25) internal successors, (150), 24 states have internal predecessors, (150), 12 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 11 states have call predecessors, (132), 12 states have call successors, (132) [2025-03-03 21:19:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1364 transitions. [2025-03-03 21:19:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 21:19:25,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:19:25,744 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:19:25,752 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-03 21:19:25,945 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,SelfDestructingSolverStorable10 [2025-03-03 21:19:25,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:19:25,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:19:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash -702997504, now seen corresponding path program 1 times [2025-03-03 21:19:25,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:19:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846234662] [2025-03-03 21:19:25,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:19:25,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 21:19:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 21:19:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:19:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986433780] [2025-03-03 21:19:26,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:19:26,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:19:26,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:19:26,013 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-03 21:19:26,015 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-03 21:19:26,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 21:19:26,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 21:19:26,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:19:26,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:19:26,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 21:19:26,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:19:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1143 proven. 504 refuted. 0 times theorem prover too weak. 2137 trivial. 0 not checked. [2025-03-03 21:19:32,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:19:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:19:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846234662] [2025-03-03 21:19:37,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:19:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986433780] [2025-03-03 21:19:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986433780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:19:37,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:19:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2025-03-03 21:19:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290707204] [2025-03-03 21:19:37,812 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:19:37,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 21:19:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:19:37,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 21:19:37,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:19:37,813 INFO L87 Difference]: Start difference. First operand 925 states and 1364 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 22 states have internal predecessors, (79), 8 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (44), 6 states have call predecessors, (44), 8 states have call successors, (44)