./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.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_fillercodesize_ps-cn-250_file-87.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 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:52:02,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:52:02,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:52:02,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:52:02,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:52:02,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:52:02,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:52:02,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:52:02,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:52:02,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:52:02,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:52:02,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:52:02,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:52:02,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:52:02,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:52:02,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:52:02,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:52:02,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:52:02,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:52:02,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:52:02,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:52:02,730 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 -> 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 [2025-03-03 19:52:02,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:52:02,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:52:03,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:52:03,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:52:03,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:52:03,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-03 19:52:04,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a13bc03c/d2722ad3ea7b41fba8a9510e189cbf55/FLAG168a48070 [2025-03-03 19:52:04,451 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:52:04,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-03 19:52:04,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a13bc03c/d2722ad3ea7b41fba8a9510e189cbf55/FLAG168a48070 [2025-03-03 19:52:04,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a13bc03c/d2722ad3ea7b41fba8a9510e189cbf55 [2025-03-03 19:52:04,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:52:04,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:52:04,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:52:04,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:52:04,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:52:04,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4250cef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04, skipping insertion in model container [2025-03-03 19:52:04,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:52:04,633 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_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-03 19:52:04,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:52:04,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:52:04,732 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_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-03 19:52:04,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:52:04,795 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:52:04,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04 WrapperNode [2025-03-03 19:52:04,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:52:04,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:52:04,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:52:04,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:52:04,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,865 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 599 [2025-03-03 19:52:04,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:52:04,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:52:04,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:52:04,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:52:04,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,910 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 19:52:04,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:52:04,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:52:04,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:52:04,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:52:04,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (1/1) ... [2025-03-03 19:52:04,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:52:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:04,979 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 19:52:04,981 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 19:52:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:52:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:52:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:52:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:52:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:52:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:52:05,087 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:52:05,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:52:05,688 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:52:05,688 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:52:05,715 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:52:05,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:52:05,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:52:05 BoogieIcfgContainer [2025-03-03 19:52:05,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:52:05,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:52:05,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:52:05,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:52:05,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:52:04" (1/3) ... [2025-03-03 19:52:05,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac02d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:52:05, skipping insertion in model container [2025-03-03 19:52:05,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:52:04" (2/3) ... [2025-03-03 19:52:05,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac02d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:52:05, skipping insertion in model container [2025-03-03 19:52:05,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:52:05" (3/3) ... [2025-03-03 19:52:05,723 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-03 19:52:05,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:52:05,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:52:05,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:52:05,804 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;@6199732a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:52:05,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:52:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:52:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-03 19:52:05,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:05,835 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:05,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 893154587, now seen corresponding path program 1 times [2025-03-03 19:52:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412498616] [2025-03-03 19:52:05,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:05,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-03 19:52:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-03 19:52:06,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:06,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 19:52:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:06,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412498616] [2025-03-03 19:52:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412498616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:06,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37071424] [2025-03-03 19:52:06,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:06,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:06,375 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 19:52:06,376 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 19:52:06,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-03 19:52:06,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-03 19:52:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:06,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:52:06,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-03 19:52:06,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:52:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37071424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:06,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:52:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:52:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364848480] [2025-03-03 19:52:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:06,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:52:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:06,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:52:06,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:52:06,803 INFO L87 Difference]: Start difference. First operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 19:52:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:06,868 INFO L93 Difference]: Finished difference Result 506 states and 943 transitions. [2025-03-03 19:52:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:52:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 577 [2025-03-03 19:52:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:06,880 INFO L225 Difference]: With dead ends: 506 [2025-03-03 19:52:06,880 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 19:52:06,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 578 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 19:52:06,889 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:06,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 19:52:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-03 19:52:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 19:52:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2025-03-03 19:52:06,960 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 577 [2025-03-03 19:52:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:06,961 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2025-03-03 19:52:06,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-03 19:52:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2025-03-03 19:52:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-03 19:52:06,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:06,973 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:06,982 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 19:52:07,174 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 19:52:07,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash -379263070, now seen corresponding path program 1 times [2025-03-03 19:52:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881969946] [2025-03-03 19:52:07,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:07,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-03 19:52:07,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-03 19:52:07,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:07,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:07,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881969946] [2025-03-03 19:52:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881969946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350371144] [2025-03-03 19:52:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:07,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:07,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:07,804 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:07,905 INFO L93 Difference]: Finished difference Result 667 states and 1114 transitions. [2025-03-03 19:52:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 578 [2025-03-03 19:52:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:07,913 INFO L225 Difference]: With dead ends: 667 [2025-03-03 19:52:07,915 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 19:52:07,916 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 19:52:07,917 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 265 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 913 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:52:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 19:52:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-03-03 19:52:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 275 states have (on average 1.5345454545454544) internal successors, (422), 276 states have internal predecessors, (422), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 19:52:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 694 transitions. [2025-03-03 19:52:08,010 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 694 transitions. Word has length 578 [2025-03-03 19:52:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:08,012 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 694 transitions. [2025-03-03 19:52:08,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 694 transitions. [2025-03-03 19:52:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:08,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:08,021 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:52:08,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1235912810, now seen corresponding path program 1 times [2025-03-03 19:52:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111637609] [2025-03-03 19:52:08,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:08,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111637609] [2025-03-03 19:52:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111637609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833233560] [2025-03-03 19:52:08,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:08,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:08,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:08,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:08,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:08,235 INFO L87 Difference]: Start difference. First operand 414 states and 694 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:08,318 INFO L93 Difference]: Finished difference Result 1113 states and 1867 transitions. [2025-03-03 19:52:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-03 19:52:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:08,327 INFO L225 Difference]: With dead ends: 1113 [2025-03-03 19:52:08,328 INFO L226 Difference]: Without dead ends: 702 [2025-03-03 19:52:08,329 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 19:52:08,330 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 253 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:08,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 914 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-03 19:52:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2025-03-03 19:52:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 467 states have (on average 1.5331905781584583) internal successors, (716), 470 states have internal predecessors, (716), 227 states have call successors, (227), 4 states have call predecessors, (227), 4 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-03-03 19:52:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1170 transitions. [2025-03-03 19:52:08,388 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1170 transitions. Word has length 579 [2025-03-03 19:52:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:08,389 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1170 transitions. [2025-03-03 19:52:08,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1170 transitions. [2025-03-03 19:52:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:08,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:08,400 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:08,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:52:08,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:08,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1204893003, now seen corresponding path program 1 times [2025-03-03 19:52:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363291300] [2025-03-03 19:52:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:08,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:08,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:08,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:08,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363291300] [2025-03-03 19:52:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363291300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:08,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240844022] [2025-03-03 19:52:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:08,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:08,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:08,644 INFO L87 Difference]: Start difference. First operand 699 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:08,767 INFO L93 Difference]: Finished difference Result 1983 states and 3322 transitions. [2025-03-03 19:52:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-03 19:52:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:08,774 INFO L225 Difference]: With dead ends: 1983 [2025-03-03 19:52:08,774 INFO L226 Difference]: Without dead ends: 1287 [2025-03-03 19:52:08,776 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 19:52:08,777 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 261 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1032 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:52:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-03-03 19:52:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1284. [2025-03-03 19:52:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 860 states have (on average 1.533720930232558) internal successors, (1319), 867 states have internal predecessors, (1319), 415 states have call successors, (415), 8 states have call predecessors, (415), 8 states have return successors, (415), 408 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-03 19:52:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2149 transitions. [2025-03-03 19:52:08,888 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2149 transitions. Word has length 579 [2025-03-03 19:52:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 2149 transitions. [2025-03-03 19:52:08,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2149 transitions. [2025-03-03 19:52:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:08,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:08,903 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:52:08,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 745407252, now seen corresponding path program 1 times [2025-03-03 19:52:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:08,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797524632] [2025-03-03 19:52:08,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:08,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:08,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797524632] [2025-03-03 19:52:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797524632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:52:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71494796] [2025-03-03 19:52:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:09,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:52:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:09,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:52:09,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:09,432 INFO L87 Difference]: Start difference. First operand 1284 states and 2149 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:10,225 INFO L93 Difference]: Finished difference Result 4278 states and 7089 transitions. [2025-03-03 19:52:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:52:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-03 19:52:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:10,243 INFO L225 Difference]: With dead ends: 4278 [2025-03-03 19:52:10,244 INFO L226 Difference]: Without dead ends: 2997 [2025-03-03 19:52:10,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:52:10,250 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 942 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:10,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2278 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:52:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-03-03 19:52:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2563. [2025-03-03 19:52:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1787 states have (on average 1.5540011191941803) internal successors, (2777), 1802 states have internal predecessors, (2777), 751 states have call successors, (751), 24 states have call predecessors, (751), 24 states have return successors, (751), 736 states have call predecessors, (751), 751 states have call successors, (751) [2025-03-03 19:52:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4279 transitions. [2025-03-03 19:52:10,470 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4279 transitions. Word has length 579 [2025-03-03 19:52:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:10,471 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4279 transitions. [2025-03-03 19:52:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4279 transitions. [2025-03-03 19:52:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:10,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:10,479 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:10,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:52:10,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash 71513268, now seen corresponding path program 1 times [2025-03-03 19:52:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028946752] [2025-03-03 19:52:10,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:10,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028946752] [2025-03-03 19:52:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028946752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:10,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:10,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:52:10,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442996105] [2025-03-03 19:52:10,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:10,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:52:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:10,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:52:10,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:10,986 INFO L87 Difference]: Start difference. First operand 2563 states and 4279 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:12,294 INFO L93 Difference]: Finished difference Result 7559 states and 12595 transitions. [2025-03-03 19:52:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:52:12,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-03 19:52:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:12,337 INFO L225 Difference]: With dead ends: 7559 [2025-03-03 19:52:12,338 INFO L226 Difference]: Without dead ends: 4999 [2025-03-03 19:52:12,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:52:12,352 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 917 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:12,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1990 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:52:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2025-03-03 19:52:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4985. [2025-03-03 19:52:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 3434 states have (on average 1.539895165987187) internal successors, (5288), 3464 states have internal predecessors, (5288), 1502 states have call successors, (1502), 48 states have call predecessors, (1502), 48 states have return successors, (1502), 1472 states have call predecessors, (1502), 1502 states have call successors, (1502) [2025-03-03 19:52:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 8292 transitions. [2025-03-03 19:52:12,655 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 8292 transitions. Word has length 579 [2025-03-03 19:52:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:12,656 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 8292 transitions. [2025-03-03 19:52:12,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 8292 transitions. [2025-03-03 19:52:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:12,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:12,663 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:52:12,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2005576786, now seen corresponding path program 1 times [2025-03-03 19:52:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662285834] [2025-03-03 19:52:12,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:12,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:12,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662285834] [2025-03-03 19:52:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662285834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:13,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:13,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:52:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692576643] [2025-03-03 19:52:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:13,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:52:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:13,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:52:13,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:52:13,249 INFO L87 Difference]: Start difference. First operand 4985 states and 8292 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:14,215 INFO L93 Difference]: Finished difference Result 24085 states and 39980 transitions. [2025-03-03 19:52:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:52:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-03 19:52:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:14,323 INFO L225 Difference]: With dead ends: 24085 [2025-03-03 19:52:14,324 INFO L226 Difference]: Without dead ends: 19103 [2025-03-03 19:52:14,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:52:14,349 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 899 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:14,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1910 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:52:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19103 states. [2025-03-03 19:52:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19103 to 19089. [2025-03-03 19:52:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19089 states, 13060 states have (on average 1.5188361408882083) internal successors, (19836), 13184 states have internal predecessors, (19836), 5836 states have call successors, (5836), 192 states have call predecessors, (5836), 192 states have return successors, (5836), 5712 states have call predecessors, (5836), 5836 states have call successors, (5836) [2025-03-03 19:52:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 31508 transitions. [2025-03-03 19:52:15,483 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 31508 transitions. Word has length 579 [2025-03-03 19:52:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 19089 states and 31508 transitions. [2025-03-03 19:52:15,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 31508 transitions. [2025-03-03 19:52:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-03 19:52:15,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:15,496 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:52:15,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:15,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1500018161, now seen corresponding path program 1 times [2025-03-03 19:52:15,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:15,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594027653] [2025-03-03 19:52:15,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:15,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:15,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:15,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:15,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 42 proven. 237 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:52:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594027653] [2025-03-03 19:52:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594027653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370516751] [2025-03-03 19:52:16,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:16,286 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 19:52:16,293 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 19:52:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-03 19:52:16,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-03 19:52:16,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:16,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:16,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 19:52:16,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 4545 proven. 237 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2025-03-03 19:52:18,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 42 proven. 237 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:52:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370516751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:19,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:52:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-03 19:52:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371996983] [2025-03-03 19:52:19,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:52:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:19,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:52:19,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:52:19,583 INFO L87 Difference]: Start difference. First operand 19089 states and 31508 transitions. Second operand has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) [2025-03-03 19:52:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:22,244 INFO L93 Difference]: Finished difference Result 55188 states and 90385 transitions. [2025-03-03 19:52:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 19:52:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) Word has length 579 [2025-03-03 19:52:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:22,410 INFO L225 Difference]: With dead ends: 55188 [2025-03-03 19:52:22,410 INFO L226 Difference]: Without dead ends: 36102 [2025-03-03 19:52:22,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 1148 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=916, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 19:52:22,488 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1888 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:22,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 1497 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:52:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2025-03-03 19:52:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 32447. [2025-03-03 19:52:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32447 states, 24355 states have (on average 1.538205707246972) internal successors, (37463), 24608 states have internal predecessors, (37463), 7642 states have call successors, (7642), 449 states have call predecessors, (7642), 449 states have return successors, (7642), 7389 states have call predecessors, (7642), 7642 states have call successors, (7642) [2025-03-03 19:52:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32447 states to 32447 states and 52747 transitions. [2025-03-03 19:52:24,211 INFO L78 Accepts]: Start accepts. Automaton has 32447 states and 52747 transitions. Word has length 579 [2025-03-03 19:52:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:24,212 INFO L471 AbstractCegarLoop]: Abstraction has 32447 states and 52747 transitions. [2025-03-03 19:52:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) [2025-03-03 19:52:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32447 states and 52747 transitions. [2025-03-03 19:52:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-03 19:52:24,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:24,233 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:24,241 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 19:52:24,433 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,SelfDestructingSolverStorable7 [2025-03-03 19:52:24,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:24,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 313870904, now seen corresponding path program 1 times [2025-03-03 19:52:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447420228] [2025-03-03 19:52:24,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 19:52:24,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 19:52:24,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:24,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 147 proven. 132 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:52:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447420228] [2025-03-03 19:52:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447420228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668674041] [2025-03-03 19:52:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:24,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:24,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:24,980 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 19:52:24,983 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 19:52:25,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-03 19:52:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-03 19:52:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:25,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:52:25,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 5643 proven. 54 refuted. 0 times theorem prover too weak. 11787 trivial. 0 not checked. [2025-03-03 19:52:26,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 225 proven. 54 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-03 19:52:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668674041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:26,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:52:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-03-03 19:52:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684036356] [2025-03-03 19:52:26,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:52:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:26,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:52:26,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:52:26,876 INFO L87 Difference]: Start difference. First operand 32447 states and 52747 transitions. Second operand has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) [2025-03-03 19:52:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:35,187 INFO L93 Difference]: Finished difference Result 115169 states and 183193 transitions. [2025-03-03 19:52:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-03 19:52:35,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) Word has length 580 [2025-03-03 19:52:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:35,509 INFO L225 Difference]: With dead ends: 115169 [2025-03-03 19:52:35,509 INFO L226 Difference]: Without dead ends: 82751 [2025-03-03 19:52:35,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1160 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1045, Invalid=3245, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 19:52:35,586 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 2945 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 1745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 5751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1745 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:35,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 4115 Invalid, 5751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1745 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 19:52:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82751 states. [2025-03-03 19:52:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82751 to 52926. [2025-03-03 19:52:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52926 states, 38373 states have (on average 1.4816407369765199) internal successors, (56855), 38775 states have internal predecessors, (56855), 13617 states have call successors, (13617), 935 states have call predecessors, (13617), 935 states have return successors, (13617), 13215 states have call predecessors, (13617), 13617 states have call successors, (13617) [2025-03-03 19:52:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52926 states to 52926 states and 84089 transitions. [2025-03-03 19:52:40,536 INFO L78 Accepts]: Start accepts. Automaton has 52926 states and 84089 transitions. Word has length 580 [2025-03-03 19:52:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:40,537 INFO L471 AbstractCegarLoop]: Abstraction has 52926 states and 84089 transitions. [2025-03-03 19:52:40,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) [2025-03-03 19:52:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52926 states and 84089 transitions. [2025-03-03 19:52:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-03 19:52:40,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:40,558 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:40,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:52:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:40,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 718063083, now seen corresponding path program 1 times [2025-03-03 19:52:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999309062] [2025-03-03 19:52:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-03 19:52:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-03 19:52:40,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999309062] [2025-03-03 19:52:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999309062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:41,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:41,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:52:41,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336233841] [2025-03-03 19:52:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:41,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:52:41,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:41,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:52:41,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:52:41,258 INFO L87 Difference]: Start difference. First operand 52926 states and 84089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:45,798 INFO L93 Difference]: Finished difference Result 98790 states and 155795 transitions. [2025-03-03 19:52:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:52:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 581 [2025-03-03 19:52:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:46,080 INFO L225 Difference]: With dead ends: 98790 [2025-03-03 19:52:46,080 INFO L226 Difference]: Without dead ends: 62980 [2025-03-03 19:52:46,180 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 19:52:46,181 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 407 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:46,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 777 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:52:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62980 states. [2025-03-03 19:52:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62980 to 62978. [2025-03-03 19:52:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62978 states, 42929 states have (on average 1.4308043513708681) internal successors, (61423), 43327 states have internal predecessors, (61423), 18681 states have call successors, (18681), 1367 states have call predecessors, (18681), 1367 states have return successors, (18681), 18283 states have call predecessors, (18681), 18681 states have call successors, (18681) [2025-03-03 19:52:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62978 states to 62978 states and 98785 transitions. [2025-03-03 19:52:50,924 INFO L78 Accepts]: Start accepts. Automaton has 62978 states and 98785 transitions. Word has length 581 [2025-03-03 19:52:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:50,925 INFO L471 AbstractCegarLoop]: Abstraction has 62978 states and 98785 transitions. [2025-03-03 19:52:50,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:52:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 62978 states and 98785 transitions. [2025-03-03 19:52:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-03 19:52:50,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:50,944 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:52:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:52:50,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -465284214, now seen corresponding path program 1 times [2025-03-03 19:52:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485396560] [2025-03-03 19:52:50,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:50,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-03 19:52:51,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-03 19:52:51,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:51,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-03 19:52:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485396560] [2025-03-03 19:52:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485396560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:52:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820801429] [2025-03-03 19:52:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:52:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:52,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:52:52,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:52:52,285 INFO L87 Difference]: Start difference. First operand 62978 states and 98785 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-03 19:53:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:53:09,893 INFO L93 Difference]: Finished difference Result 217915 states and 341985 transitions. [2025-03-03 19:53:09,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:53:09,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 581 [2025-03-03 19:53:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:53:10,697 INFO L225 Difference]: With dead ends: 217915 [2025-03-03 19:53:10,697 INFO L226 Difference]: Without dead ends: 189991 [2025-03-03 19:53:10,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:53:10,834 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 2061 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 894 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 894 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:53:10,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 2406 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [894 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 19:53:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189991 states.