./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.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 d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:55:06,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:55:06,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:55:06,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:55:06,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:55:07,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:55:07,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:55:07,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:55:07,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:55:07,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:55:07,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:55:07,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:55:07,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:55:07,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:55:07,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:55:07,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:55:07,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:55:07,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:55:07,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:55:07,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:55:07,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:55:07,006 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 -> d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 [2025-03-08 13:55:07,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:55:07,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:55:07,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:55:07,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:55:07,235 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:55:07,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-08 13:55:08,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350833fd2/b2b623d682de44148631fdfd62cce2a0/FLAGe6df0f419 [2025-03-08 13:55:08,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:55:08,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-08 13:55:08,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350833fd2/b2b623d682de44148631fdfd62cce2a0/FLAGe6df0f419 [2025-03-08 13:55:08,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350833fd2/b2b623d682de44148631fdfd62cce2a0 [2025-03-08 13:55:08,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:55:08,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:55:08,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:55:08,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:55:08,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:55:08,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:55:08" (1/1) ... [2025-03-08 13:55:08,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:08, skipping insertion in model container [2025-03-08 13:55:08,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:55:08" (1/1) ... [2025-03-08 13:55:08,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:55:09,022 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-03-08 13:55:09,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:55:09,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:55:09,124 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-03-08 13:55:09,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:55:09,175 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:55:09,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09 WrapperNode [2025-03-08 13:55:09,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:55:09,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:55:09,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:55:09,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:55:09,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,241 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-03-08 13:55:09,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:55:09,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:55:09,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:55:09,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:55:09,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,273 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:55:09,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:55:09,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:55:09,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:55:09,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:55:09,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (1/1) ... [2025-03-08 13:55:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:55:09,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:55:09,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:55:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:55:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:55:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:55:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:55:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:55:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:55:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:55:09,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:55:09,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:55:09,768 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-08 13:55:09,810 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-08 13:55:09,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:55:09,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:55:09,829 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 13:55:09,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:55:09 BoogieIcfgContainer [2025-03-08 13:55:09,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:55:09,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:55:09,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:55:09,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:55:09,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:55:08" (1/3) ... [2025-03-08 13:55:09,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ece5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:55:09, skipping insertion in model container [2025-03-08 13:55:09,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:55:09" (2/3) ... [2025-03-08 13:55:09,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1ece5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:55:09, skipping insertion in model container [2025-03-08 13:55:09,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:55:09" (3/3) ... [2025-03-08 13:55:09,837 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-08 13:55:09,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:55:09,849 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:55:09,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:55:09,927 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;@1a2ebf1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:55:09,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:55:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 13:55:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 13:55:09,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:09,942 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:09,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1272848649, now seen corresponding path program 1 times [2025-03-08 13:55:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878933227] [2025-03-08 13:55:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:10,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 13:55:10,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 13:55:10,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:10,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 13:55:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878933227] [2025-03-08 13:55:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878933227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:55:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689232181] [2025-03-08 13:55:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:10,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:55:10,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:55:10,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:55:10,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:55:10,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 13:55:10,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 13:55:10,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:10,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:10,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:55:10,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:55:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 13:55:10,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:55:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689232181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:10,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:55:10,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:55:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61098678] [2025-03-08 13:55:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:10,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:55:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:10,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:55:10,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:55:10,480 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:55:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:10,513 INFO L93 Difference]: Finished difference Result 227 states and 384 transitions. [2025-03-08 13:55:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:55:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-03-08 13:55:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:10,522 INFO L225 Difference]: With dead ends: 227 [2025-03-08 13:55:10,522 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 13:55:10,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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-08 13:55:10,530 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:10,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:55:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 13:55:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 13:55:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 13:55:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-08 13:55:10,575 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-03-08 13:55:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-08 13:55:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 13:55:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-08 13:55:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 13:55:10,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:10,580 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:10,587 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-08 13:55:10,780 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-08 13:55:10,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1694400884, now seen corresponding path program 1 times [2025-03-08 13:55:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:10,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-03-08 13:55:10,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:10,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 13:55:10,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 13:55:10,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:10,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:11,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:11,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711085038] [2025-03-08 13:55:11,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711085038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:11,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:55:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161813312] [2025-03-08 13:55:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:55:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:11,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:55:11,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:55:11,224 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:11,467 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-03-08 13:55:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:55:11,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-08 13:55:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:11,471 INFO L225 Difference]: With dead ends: 364 [2025-03-08 13:55:11,472 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 13:55:11,473 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-08 13:55:11,473 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 168 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:11,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 514 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:55:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 13:55:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-03-08 13:55:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 13:55:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-03-08 13:55:11,504 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-03-08 13:55:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-03-08 13:55:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-03-08 13:55:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 13:55:11,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:11,510 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:55:11,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1361276800, now seen corresponding path program 1 times [2025-03-08 13:55:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:11,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114799947] [2025-03-08 13:55:11,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:11,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 13:55:11,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 13:55:11,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:11,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114799947] [2025-03-08 13:55:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114799947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:55:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384198540] [2025-03-08 13:55:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:55:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:13,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:55:13,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:13,028 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:14,131 INFO L93 Difference]: Finished difference Result 1020 states and 1525 transitions. [2025-03-08 13:55:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-08 13:55:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:14,138 INFO L225 Difference]: With dead ends: 1020 [2025-03-08 13:55:14,141 INFO L226 Difference]: Without dead ends: 779 [2025-03-08 13:55:14,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:55:14,142 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 762 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:14,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 526 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 13:55:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-08 13:55:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 359. [2025-03-08 13:55:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 284 states have (on average 1.4330985915492958) internal successors, (407), 286 states have internal predecessors, (407), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 13:55:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 547 transitions. [2025-03-08 13:55:14,193 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 547 transitions. Word has length 205 [2025-03-08 13:55:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 547 transitions. [2025-03-08 13:55:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 547 transitions. [2025-03-08 13:55:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 13:55:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:14,196 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:55:14,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash 855718175, now seen corresponding path program 1 times [2025-03-08 13:55:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363673169] [2025-03-08 13:55:14,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:14,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 13:55:14,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 13:55:14,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:14,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:14,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363673169] [2025-03-08 13:55:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363673169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:55:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144533409] [2025-03-08 13:55:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:14,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:55:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:14,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:55:14,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:55:14,411 INFO L87 Difference]: Start difference. First operand 359 states and 547 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:14,627 INFO L93 Difference]: Finished difference Result 967 states and 1471 transitions. [2025-03-08 13:55:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:55:14,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-08 13:55:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:14,632 INFO L225 Difference]: With dead ends: 967 [2025-03-08 13:55:14,633 INFO L226 Difference]: Without dead ends: 618 [2025-03-08 13:55:14,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:55:14,635 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:14,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 640 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:55:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-08 13:55:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 483. [2025-03-08 13:55:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 378 states have internal predecessors, (535), 101 states have call successors, (101), 6 states have call predecessors, (101), 6 states have return successors, (101), 98 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 13:55:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 737 transitions. [2025-03-08 13:55:14,697 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 737 transitions. Word has length 205 [2025-03-08 13:55:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 737 transitions. [2025-03-08 13:55:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 737 transitions. [2025-03-08 13:55:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:14,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:14,702 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:55:14,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1217102130, now seen corresponding path program 1 times [2025-03-08 13:55:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881391350] [2025-03-08 13:55:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:14,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:14,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:14,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881391350] [2025-03-08 13:55:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881391350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 13:55:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655955433] [2025-03-08 13:55:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:15,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 13:55:15,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:15,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 13:55:15,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:55:15,032 INFO L87 Difference]: Start difference. First operand 483 states and 737 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:15,574 INFO L93 Difference]: Finished difference Result 1271 states and 1920 transitions. [2025-03-08 13:55:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:55:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:15,579 INFO L225 Difference]: With dead ends: 1271 [2025-03-08 13:55:15,579 INFO L226 Difference]: Without dead ends: 798 [2025-03-08 13:55:15,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:55:15,581 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 241 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 658 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:55:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-08 13:55:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 683. [2025-03-08 13:55:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 555 states have (on average 1.4198198198198198) internal successors, (788), 561 states have internal predecessors, (788), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1022 transitions. [2025-03-08 13:55:15,643 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1022 transitions. Word has length 206 [2025-03-08 13:55:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1022 transitions. [2025-03-08 13:55:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1022 transitions. [2025-03-08 13:55:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:15,646 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:55:15,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash 27662351, now seen corresponding path program 1 times [2025-03-08 13:55:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470317479] [2025-03-08 13:55:15,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:15,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:15,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470317479] [2025-03-08 13:55:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470317479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 13:55:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443115959] [2025-03-08 13:55:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 13:55:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 13:55:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:55:20,969 INFO L87 Difference]: Start difference. First operand 683 states and 1022 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:24,042 INFO L93 Difference]: Finished difference Result 1951 states and 2897 transitions. [2025-03-08 13:55:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:55:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:24,049 INFO L225 Difference]: With dead ends: 1951 [2025-03-08 13:55:24,050 INFO L226 Difference]: Without dead ends: 1278 [2025-03-08 13:55:24,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:55:24,053 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 709 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:24,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 997 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 13:55:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-08 13:55:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 859. [2025-03-08 13:55:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 731 states have (on average 1.4172366621067032) internal successors, (1036), 737 states have internal predecessors, (1036), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1270 transitions. [2025-03-08 13:55:24,122 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1270 transitions. Word has length 206 [2025-03-08 13:55:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:24,125 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1270 transitions. [2025-03-08 13:55:24,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1270 transitions. [2025-03-08 13:55:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:24,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:24,127 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:24,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:55:24,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:24,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -477896274, now seen corresponding path program 1 times [2025-03-08 13:55:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337644900] [2025-03-08 13:55:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:24,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:24,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:24,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337644900] [2025-03-08 13:55:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337644900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:55:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673735373] [2025-03-08 13:55:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:25,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:55:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:25,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:55:25,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:25,261 INFO L87 Difference]: Start difference. First operand 859 states and 1270 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:26,311 INFO L93 Difference]: Finished difference Result 1865 states and 2764 transitions. [2025-03-08 13:55:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:26,318 INFO L225 Difference]: With dead ends: 1865 [2025-03-08 13:55:26,319 INFO L226 Difference]: Without dead ends: 1380 [2025-03-08 13:55:26,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:55:26,320 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 360 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:26,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 982 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 13:55:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-08 13:55:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1054. [2025-03-08 13:55:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 926 states have (on average 1.4038876889848813) internal successors, (1300), 932 states have internal predecessors, (1300), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1534 transitions. [2025-03-08 13:55:26,366 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1534 transitions. Word has length 206 [2025-03-08 13:55:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:26,367 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1534 transitions. [2025-03-08 13:55:26,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1534 transitions. [2025-03-08 13:55:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:26,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:26,369 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:55:26,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash -881738948, now seen corresponding path program 1 times [2025-03-08 13:55:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229149637] [2025-03-08 13:55:26,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:26,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:26,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:26,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:26,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229149637] [2025-03-08 13:55:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229149637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:28,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:55:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717351124] [2025-03-08 13:55:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:55:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:28,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:55:28,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:55:28,639 INFO L87 Difference]: Start difference. First operand 1054 states and 1534 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:30,948 INFO L93 Difference]: Finished difference Result 2452 states and 3543 transitions. [2025-03-08 13:55:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:55:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:30,957 INFO L225 Difference]: With dead ends: 2452 [2025-03-08 13:55:30,960 INFO L226 Difference]: Without dead ends: 1408 [2025-03-08 13:55:30,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:55:30,962 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 669 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:30,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 721 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 13:55:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-08 13:55:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1109. [2025-03-08 13:55:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 981 states have (on average 1.4097859327217126) internal successors, (1383), 987 states have internal predecessors, (1383), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1617 transitions. [2025-03-08 13:55:31,004 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1617 transitions. Word has length 206 [2025-03-08 13:55:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1617 transitions. [2025-03-08 13:55:31,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1617 transitions. [2025-03-08 13:55:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:31,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:31,006 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:31,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:55:31,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 625812861, now seen corresponding path program 1 times [2025-03-08 13:55:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110421860] [2025-03-08 13:55:31,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:31,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:31,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:31,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:31,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:31,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110421860] [2025-03-08 13:55:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110421860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:31,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:55:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207178323] [2025-03-08 13:55:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:31,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:55:31,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:31,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:55:31,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:31,771 INFO L87 Difference]: Start difference. First operand 1109 states and 1617 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:32,331 INFO L93 Difference]: Finished difference Result 2832 states and 4137 transitions. [2025-03-08 13:55:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:32,338 INFO L225 Difference]: With dead ends: 2832 [2025-03-08 13:55:32,338 INFO L226 Difference]: Without dead ends: 1733 [2025-03-08 13:55:32,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:55:32,341 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 237 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:32,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 591 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:55:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-03-08 13:55:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1250. [2025-03-08 13:55:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1122 states have (on average 1.4376114081996434) internal successors, (1613), 1128 states have internal predecessors, (1613), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1847 transitions. [2025-03-08 13:55:32,388 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1847 transitions. Word has length 206 [2025-03-08 13:55:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:32,388 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1847 transitions. [2025-03-08 13:55:32,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1847 transitions. [2025-03-08 13:55:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:32,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:32,390 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:32,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:55:32,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:32,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:32,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1726210819, now seen corresponding path program 1 times [2025-03-08 13:55:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:32,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569083195] [2025-03-08 13:55:32,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:32,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:32,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:32,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:32,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:33,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569083195] [2025-03-08 13:55:33,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569083195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:33,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:33,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:55:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852256439] [2025-03-08 13:55:33,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:55:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:33,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:55:33,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:55:33,545 INFO L87 Difference]: Start difference. First operand 1250 states and 1847 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:34,505 INFO L93 Difference]: Finished difference Result 2836 states and 4172 transitions. [2025-03-08 13:55:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:34,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:34,511 INFO L225 Difference]: With dead ends: 2836 [2025-03-08 13:55:34,511 INFO L226 Difference]: Without dead ends: 1596 [2025-03-08 13:55:34,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:34,513 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 328 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:34,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 519 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 13:55:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-08 13:55:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1265. [2025-03-08 13:55:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1137 states have (on average 1.4388742304309587) internal successors, (1636), 1143 states have internal predecessors, (1636), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1870 transitions. [2025-03-08 13:55:34,573 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1870 transitions. Word has length 206 [2025-03-08 13:55:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1870 transitions. [2025-03-08 13:55:34,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1870 transitions. [2025-03-08 13:55:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 13:55:34,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:34,576 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:55:34,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -218659010, now seen corresponding path program 1 times [2025-03-08 13:55:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678545185] [2025-03-08 13:55:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 13:55:34,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 13:55:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:35,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:35,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678545185] [2025-03-08 13:55:35,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678545185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:35,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:55:35,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836987694] [2025-03-08 13:55:35,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:35,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:55:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:35,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:55:35,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:55:35,326 INFO L87 Difference]: Start difference. First operand 1265 states and 1870 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:36,565 INFO L93 Difference]: Finished difference Result 3019 states and 4451 transitions. [2025-03-08 13:55:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-08 13:55:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:36,570 INFO L225 Difference]: With dead ends: 3019 [2025-03-08 13:55:36,570 INFO L226 Difference]: Without dead ends: 1764 [2025-03-08 13:55:36,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:55:36,572 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 254 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:36,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 888 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 13:55:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-03-08 13:55:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1233. [2025-03-08 13:55:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1105 states have (on average 1.4343891402714932) internal successors, (1585), 1111 states have internal predecessors, (1585), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 13:55:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1819 transitions. [2025-03-08 13:55:36,613 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1819 transitions. Word has length 206 [2025-03-08 13:55:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:36,613 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1819 transitions. [2025-03-08 13:55:36,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1819 transitions. [2025-03-08 13:55:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 13:55:36,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:36,614 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:55:36,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:36,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1616175650, now seen corresponding path program 1 times [2025-03-08 13:55:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441327722] [2025-03-08 13:55:36,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:36,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 13:55:36,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 13:55:36,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:36,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441327722] [2025-03-08 13:55:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441327722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:55:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206258328] [2025-03-08 13:55:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:36,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:55:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:55:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:55:36,798 INFO L87 Difference]: Start difference. First operand 1233 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:37,040 INFO L93 Difference]: Finished difference Result 2575 states and 3784 transitions. [2025-03-08 13:55:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:55:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-08 13:55:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:37,045 INFO L225 Difference]: With dead ends: 2575 [2025-03-08 13:55:37,045 INFO L226 Difference]: Without dead ends: 1352 [2025-03-08 13:55:37,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:55:37,047 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 169 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:37,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 539 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:55:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-03-08 13:55:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1151. [2025-03-08 13:55:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1060 states have (on average 1.4433962264150944) internal successors, (1530), 1064 states have internal predecessors, (1530), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 13:55:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1694 transitions. [2025-03-08 13:55:37,082 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1694 transitions. Word has length 207 [2025-03-08 13:55:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1694 transitions. [2025-03-08 13:55:37,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1694 transitions. [2025-03-08 13:55:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:37,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:37,083 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:55:37,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:37,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1143825369, now seen corresponding path program 1 times [2025-03-08 13:55:37,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:37,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067647455] [2025-03-08 13:55:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:37,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:37,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:37,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:37,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067647455] [2025-03-08 13:55:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067647455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:38,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:55:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716610651] [2025-03-08 13:55:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:38,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:55:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:38,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:55:38,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:55:38,231 INFO L87 Difference]: Start difference. First operand 1151 states and 1694 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:39,593 INFO L93 Difference]: Finished difference Result 2345 states and 3466 transitions. [2025-03-08 13:55:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:55:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 13:55:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:39,599 INFO L225 Difference]: With dead ends: 2345 [2025-03-08 13:55:39,600 INFO L226 Difference]: Without dead ends: 1619 [2025-03-08 13:55:39,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:55:39,603 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 540 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:39,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1283 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 13:55:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-03-08 13:55:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1167. [2025-03-08 13:55:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1076 states have (on average 1.4433085501858736) internal successors, (1553), 1080 states have internal predecessors, (1553), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 13:55:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1717 transitions. [2025-03-08 13:55:39,668 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1717 transitions. Word has length 208 [2025-03-08 13:55:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1717 transitions. [2025-03-08 13:55:39,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1717 transitions. [2025-03-08 13:55:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:39,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:39,671 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 13:55:39,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 638266744, now seen corresponding path program 1 times [2025-03-08 13:55:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725053427] [2025-03-08 13:55:39,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:39,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:39,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:39,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:39,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725053427] [2025-03-08 13:55:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725053427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:55:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258320511] [2025-03-08 13:55:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:55:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:40,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:55:40,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:55:40,601 INFO L87 Difference]: Start difference. First operand 1167 states and 1717 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:41,552 INFO L93 Difference]: Finished difference Result 2935 states and 4330 transitions. [2025-03-08 13:55:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:55:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 13:55:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:41,558 INFO L225 Difference]: With dead ends: 2935 [2025-03-08 13:55:41,559 INFO L226 Difference]: Without dead ends: 1771 [2025-03-08 13:55:41,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:41,561 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 219 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:41,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 710 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 13:55:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-08 13:55:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1287. [2025-03-08 13:55:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1196 states have (on average 1.4473244147157192) internal successors, (1731), 1200 states have internal predecessors, (1731), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 13:55:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1895 transitions. [2025-03-08 13:55:41,608 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1895 transitions. Word has length 208 [2025-03-08 13:55:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:41,610 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1895 transitions. [2025-03-08 13:55:41,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1895 transitions. [2025-03-08 13:55:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:41,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:41,612 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 13:55:41,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1693606673, now seen corresponding path program 1 times [2025-03-08 13:55:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358432081] [2025-03-08 13:55:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:41,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:41,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:41,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:41,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358432081] [2025-03-08 13:55:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358432081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 13:55:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778223006] [2025-03-08 13:55:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:55:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:55:42,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:55:42,869 INFO L87 Difference]: Start difference. First operand 1287 states and 1895 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:43,940 INFO L93 Difference]: Finished difference Result 3411 states and 4955 transitions. [2025-03-08 13:55:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:55:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 13:55:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:43,946 INFO L225 Difference]: With dead ends: 3411 [2025-03-08 13:55:43,947 INFO L226 Difference]: Without dead ends: 2127 [2025-03-08 13:55:43,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:55:43,950 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 366 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:43,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 13:55:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-03-08 13:55:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1384. [2025-03-08 13:55:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1293 states have (on average 1.4593967517401392) internal successors, (1887), 1297 states have internal predecessors, (1887), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 13:55:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2051 transitions. [2025-03-08 13:55:43,995 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2051 transitions. Word has length 208 [2025-03-08 13:55:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:43,995 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2051 transitions. [2025-03-08 13:55:43,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2051 transitions. [2025-03-08 13:55:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:43,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:43,997 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 13:55:43,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:43,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:43,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1188048048, now seen corresponding path program 1 times [2025-03-08 13:55:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388368046] [2025-03-08 13:55:43,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:44,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:44,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:44,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:44,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388368046] [2025-03-08 13:55:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388368046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:45,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:55:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367705102] [2025-03-08 13:55:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:45,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:55:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:45,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:55:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:55:45,547 INFO L87 Difference]: Start difference. First operand 1384 states and 2051 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:47,206 INFO L93 Difference]: Finished difference Result 3750 states and 5489 transitions. [2025-03-08 13:55:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:55:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-03-08 13:55:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:47,213 INFO L225 Difference]: With dead ends: 3750 [2025-03-08 13:55:47,213 INFO L226 Difference]: Without dead ends: 2369 [2025-03-08 13:55:47,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:55:47,215 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 401 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:47,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 804 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 13:55:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-08 13:55:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1394. [2025-03-08 13:55:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1303 states have (on average 1.4597083653108212) internal successors, (1902), 1307 states have internal predecessors, (1902), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 13:55:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2066 transitions. [2025-03-08 13:55:47,257 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2066 transitions. Word has length 208 [2025-03-08 13:55:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:47,257 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2066 transitions. [2025-03-08 13:55:47,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 13:55:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2066 transitions. [2025-03-08 13:55:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:47,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:47,258 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:47,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 13:55:47,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:47,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 677513871, now seen corresponding path program 1 times [2025-03-08 13:55:47,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:47,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707776051] [2025-03-08 13:55:47,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:47,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:47,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:47,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:47,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 13:55:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707776051] [2025-03-08 13:55:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707776051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:55:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:55:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:55:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541116759] [2025-03-08 13:55:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:55:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:55:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:55:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:55:47,652 INFO L87 Difference]: Start difference. First operand 1394 states and 2066 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 13:55:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:48,465 INFO L93 Difference]: Finished difference Result 4648 states and 6827 transitions. [2025-03-08 13:55:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 13:55:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 208 [2025-03-08 13:55:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:48,477 INFO L225 Difference]: With dead ends: 4648 [2025-03-08 13:55:48,477 INFO L226 Difference]: Without dead ends: 3257 [2025-03-08 13:55:48,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:55:48,480 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 743 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:48,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 825 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:55:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2025-03-08 13:55:48,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2577. [2025-03-08 13:55:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 2396 states have (on average 1.4574290484140233) internal successors, (3492), 2404 states have internal predecessors, (3492), 164 states have call successors, (164), 16 states have call predecessors, (164), 16 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 13:55:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 3820 transitions. [2025-03-08 13:55:48,568 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 3820 transitions. Word has length 208 [2025-03-08 13:55:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 2577 states and 3820 transitions. [2025-03-08 13:55:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 13:55:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 3820 transitions. [2025-03-08 13:55:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 13:55:48,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:48,570 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:48,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 13:55:48,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1946279994, now seen corresponding path program 1 times [2025-03-08 13:55:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219475648] [2025-03-08 13:55:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-08 13:55:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:55:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219475648] [2025-03-08 13:55:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219475648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:55:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888495827] [2025-03-08 13:55:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:48,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:55:48,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:55:48,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:55:48,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:55:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 13:55:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 13:55:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:55:48,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 13:55:48,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:55:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-08 13:55:49,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:55:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888495827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:55:49,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:55:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2025-03-08 13:55:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608405339] [2025-03-08 13:55:49,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:55:49,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:55:49,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:55:49,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:55:49,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:55:49,656 INFO L87 Difference]: Start difference. First operand 2577 states and 3820 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 13:55:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:55:50,437 INFO L93 Difference]: Finished difference Result 4842 states and 7092 transitions. [2025-03-08 13:55:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 13:55:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 208 [2025-03-08 13:55:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:55:50,444 INFO L225 Difference]: With dead ends: 4842 [2025-03-08 13:55:50,444 INFO L226 Difference]: Without dead ends: 2268 [2025-03-08 13:55:50,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2025-03-08 13:55:50,447 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 291 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:55:50,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 620 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:55:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2025-03-08 13:55:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2213. [2025-03-08 13:55:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1985 states have (on average 1.4141057934508816) internal successors, (2807), 1994 states have internal predecessors, (2807), 195 states have call successors, (195), 32 states have call predecessors, (195), 32 states have return successors, (195), 186 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-08 13:55:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3197 transitions. [2025-03-08 13:55:50,577 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3197 transitions. Word has length 208 [2025-03-08 13:55:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:55:50,577 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3197 transitions. [2025-03-08 13:55:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (51), 3 states have call predecessors, (51), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 13:55:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3197 transitions. [2025-03-08 13:55:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 13:55:50,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:55:50,580 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:55:50,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 13:55:50,780 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,SelfDestructingSolverStorable17 [2025-03-08 13:55:50,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:55:50,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:55:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash -78979673, now seen corresponding path program 1 times [2025-03-08 13:55:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:55:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912569367] [2025-03-08 13:55:50,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:55:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:55:50,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 13:55:51,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 13:55:51,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:55:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat