./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.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 ce8bf6dec5b27745c6bfb98fc715d507cc2238369c7f83c0b6f0bf89b9d57526 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:20,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:20,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:20,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:20,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:20,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:20,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:20,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:20,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:20,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:20,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:20,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:20,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:20,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:20,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:20,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:20,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:20,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:20,972 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 -> ce8bf6dec5b27745c6bfb98fc715d507cc2238369c7f83c0b6f0bf89b9d57526 [2025-03-03 20:08:21,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:21,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:21,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:21,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:21,185 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:21,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i [2025-03-03 20:08:22,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278dc0d81/0eeb276ece87402db769285e9ffb429c/FLAG42b437767 [2025-03-03 20:08:22,640 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:22,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i [2025-03-03 20:08:22,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278dc0d81/0eeb276ece87402db769285e9ffb429c/FLAG42b437767 [2025-03-03 20:08:22,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278dc0d81/0eeb276ece87402db769285e9ffb429c [2025-03-03 20:08:22,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:22,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:22,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:22,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:22,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:22,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:22" (1/1) ... [2025-03-03 20:08:22,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f01ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:22, skipping insertion in model container [2025-03-03 20:08:22,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:22" (1/1) ... [2025-03-03 20:08:22,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:23,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i[916,929] [2025-03-03 20:08:23,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:23,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:23,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-46.i[916,929] [2025-03-03 20:08:23,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:23,264 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:23,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23 WrapperNode [2025-03-03 20:08:23,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:23,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:23,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:23,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:23,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,359 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 845 [2025-03-03 20:08:23,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:23,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:23,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:23,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:23,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:08:23,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:23,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:23,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:23,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:23,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (1/1) ... [2025-03-03 20:08:23,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:23,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:23,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:08:23,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:08:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:23,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:23,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:23,644 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:23,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:24,529 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc property_#t~bitwise79#1;havoc property_#t~bitwise80#1;havoc property_#t~short81#1; [2025-03-03 20:08:24,738 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:24,738 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:24,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:24,760 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:08:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:24 BoogieIcfgContainer [2025-03-03 20:08:24,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:24,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:24,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:24,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:24,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:22" (1/3) ... [2025-03-03 20:08:24,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0a582f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:24, skipping insertion in model container [2025-03-03 20:08:24,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:23" (2/3) ... [2025-03-03 20:08:24,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0a582f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:24, skipping insertion in model container [2025-03-03 20:08:24,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:24" (3/3) ... [2025-03-03 20:08:24,767 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-46.i [2025-03-03 20:08:24,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:24,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-46.i that has 2 procedures, 345 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:08:24,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:24,852 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;@14d69eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:24,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 345 states, 240 states have (on average 1.5875) internal successors, (381), 241 states have internal predecessors, (381), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:08:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:08:24,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:24,881 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:24,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1896151316, now seen corresponding path program 1 times [2025-03-03 20:08:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:24,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312219097] [2025-03-03 20:08:24,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:25,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:08:25,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:08:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:25,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:08:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:25,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312219097] [2025-03-03 20:08:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312219097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324311428] [2025-03-03 20:08:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:25,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:25,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:25,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:25,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:08:25,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:08:25,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:08:25,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:25,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:25,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:08:25,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:08:25,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324311428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:08:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409136700] [2025-03-03 20:08:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:25,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:25,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:25,909 INFO L87 Difference]: Start difference. First operand has 345 states, 240 states have (on average 1.5875) internal successors, (381), 241 states have internal predecessors, (381), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:08:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:26,001 INFO L93 Difference]: Finished difference Result 684 states and 1267 transitions. [2025-03-03 20:08:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 658 [2025-03-03 20:08:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:26,012 INFO L225 Difference]: With dead ends: 684 [2025-03-03 20:08:26,013 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 20:08:26,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:26,022 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:26,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 20:08:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-03 20:08:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 238 states have (on average 1.5546218487394958) internal successors, (370), 238 states have internal predecessors, (370), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:08:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 574 transitions. [2025-03-03 20:08:26,110 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 574 transitions. Word has length 658 [2025-03-03 20:08:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:26,111 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 574 transitions. [2025-03-03 20:08:26,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:08:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 574 transitions. [2025-03-03 20:08:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-03 20:08:26,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:26,127 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:26,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:08:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:08:26,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1762831301, now seen corresponding path program 1 times [2025-03-03 20:08:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134771841] [2025-03-03 20:08:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-03 20:08:26,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-03 20:08:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134771841] [2025-03-03 20:08:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134771841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:26,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250771263] [2025-03-03 20:08:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:26,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:26,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:26,936 INFO L87 Difference]: Start difference. First operand 342 states and 574 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:27,082 INFO L93 Difference]: Finished difference Result 865 states and 1459 transitions. [2025-03-03 20:08:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 659 [2025-03-03 20:08:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:27,093 INFO L225 Difference]: With dead ends: 865 [2025-03-03 20:08:27,094 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 20:08:27,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:27,096 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 308 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 20:08:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2025-03-03 20:08:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 387 states have (on average 1.599483204134367) internal successors, (619), 388 states have internal predecessors, (619), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-03 20:08:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 885 transitions. [2025-03-03 20:08:27,156 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 885 transitions. Word has length 659 [2025-03-03 20:08:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:27,157 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 885 transitions. [2025-03-03 20:08:27,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 885 transitions. [2025-03-03 20:08:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 20:08:27,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:27,170 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:27,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:08:27,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1053446338, now seen corresponding path program 1 times [2025-03-03 20:08:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080668154] [2025-03-03 20:08:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:27,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 20:08:27,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 20:08:27,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080668154] [2025-03-03 20:08:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080668154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:27,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950935833] [2025-03-03 20:08:27,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:27,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:27,544 INFO L87 Difference]: Start difference. First operand 523 states and 885 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:27,667 INFO L93 Difference]: Finished difference Result 1398 states and 2375 transitions. [2025-03-03 20:08:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-03-03 20:08:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:27,680 INFO L225 Difference]: With dead ends: 1398 [2025-03-03 20:08:27,681 INFO L226 Difference]: Without dead ends: 878 [2025-03-03 20:08:27,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:27,685 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 290 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:27,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1225 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-03 20:08:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 874. [2025-03-03 20:08:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 690 states have (on average 1.6318840579710145) internal successors, (1126), 693 states have internal predecessors, (1126), 179 states have call successors, (179), 4 states have call predecessors, (179), 4 states have return successors, (179), 176 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-03 20:08:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1484 transitions. [2025-03-03 20:08:27,767 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1484 transitions. Word has length 661 [2025-03-03 20:08:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:27,770 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1484 transitions. [2025-03-03 20:08:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1484 transitions. [2025-03-03 20:08:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 20:08:27,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:27,781 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:27,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:08:27,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:27,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1472963169, now seen corresponding path program 1 times [2025-03-03 20:08:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:27,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539040306] [2025-03-03 20:08:27,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:27,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 20:08:27,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 20:08:27,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:27,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:28,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539040306] [2025-03-03 20:08:28,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539040306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:28,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:28,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605818900] [2025-03-03 20:08:28,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:28,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:28,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:28,060 INFO L87 Difference]: Start difference. First operand 874 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:28,186 INFO L93 Difference]: Finished difference Result 2429 states and 4122 transitions. [2025-03-03 20:08:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-03-03 20:08:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:28,197 INFO L225 Difference]: With dead ends: 2429 [2025-03-03 20:08:28,198 INFO L226 Difference]: Without dead ends: 1558 [2025-03-03 20:08:28,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:28,202 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 295 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:28,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1206 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-03-03 20:08:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1552. [2025-03-03 20:08:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1280 states have (on average 1.63203125) internal successors, (2089), 1287 states have internal predecessors, (2089), 263 states have call successors, (263), 8 states have call predecessors, (263), 8 states have return successors, (263), 256 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 20:08:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2615 transitions. [2025-03-03 20:08:28,285 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2615 transitions. Word has length 661 [2025-03-03 20:08:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:28,286 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 2615 transitions. [2025-03-03 20:08:28,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2615 transitions. [2025-03-03 20:08:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 20:08:28,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:28,292 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:28,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:08:28,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:28,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1554427773, now seen corresponding path program 1 times [2025-03-03 20:08:28,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:28,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768333480] [2025-03-03 20:08:28,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:28,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 20:08:28,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 20:08:28,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:28,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768333480] [2025-03-03 20:08:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768333480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:28,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129833667] [2025-03-03 20:08:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:28,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:28,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:28,746 INFO L87 Difference]: Start difference. First operand 1552 states and 2615 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:28,853 INFO L93 Difference]: Finished difference Result 3103 states and 5231 transitions. [2025-03-03 20:08:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-03-03 20:08:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:28,865 INFO L225 Difference]: With dead ends: 3103 [2025-03-03 20:08:28,866 INFO L226 Difference]: Without dead ends: 1554 [2025-03-03 20:08:28,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:28,871 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:28,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1082 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-03 20:08:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-03 20:08:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1282 states have (on average 1.6310452418096724) internal successors, (2091), 1289 states have internal predecessors, (2091), 263 states have call successors, (263), 8 states have call predecessors, (263), 8 states have return successors, (263), 256 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 20:08:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2617 transitions. [2025-03-03 20:08:28,947 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2617 transitions. Word has length 661 [2025-03-03 20:08:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:28,948 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2617 transitions. [2025-03-03 20:08:28,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2617 transitions. [2025-03-03 20:08:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:28,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:28,954 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:08:28,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -718378514, now seen corresponding path program 1 times [2025-03-03 20:08:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005543477] [2025-03-03 20:08:28,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:28,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:29,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005543477] [2025-03-03 20:08:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005543477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202068535] [2025-03-03 20:08:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:29,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:29,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:29,370 INFO L87 Difference]: Start difference. First operand 1554 states and 2617 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:29,536 INFO L93 Difference]: Finished difference Result 4475 states and 7544 transitions. [2025-03-03 20:08:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:29,550 INFO L225 Difference]: With dead ends: 4475 [2025-03-03 20:08:29,551 INFO L226 Difference]: Without dead ends: 2924 [2025-03-03 20:08:29,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:29,556 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 309 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:29,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1064 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2025-03-03 20:08:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2914. [2025-03-03 20:08:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2482 states have (on average 1.645044319097502) internal successors, (4083), 2497 states have internal predecessors, (4083), 415 states have call successors, (415), 16 states have call predecessors, (415), 16 states have return successors, (415), 400 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-03 20:08:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 4913 transitions. [2025-03-03 20:08:29,705 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 4913 transitions. Word has length 662 [2025-03-03 20:08:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:29,706 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 4913 transitions. [2025-03-03 20:08:29,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 4913 transitions. [2025-03-03 20:08:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:29,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:29,713 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:29,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:08:29,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:29,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1651055471, now seen corresponding path program 1 times [2025-03-03 20:08:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177540755] [2025-03-03 20:08:29,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:29,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:29,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177540755] [2025-03-03 20:08:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177540755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:30,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30309129] [2025-03-03 20:08:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:30,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:30,124 INFO L87 Difference]: Start difference. First operand 2914 states and 4913 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:30,344 INFO L93 Difference]: Finished difference Result 8581 states and 14498 transitions. [2025-03-03 20:08:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:30,376 INFO L225 Difference]: With dead ends: 8581 [2025-03-03 20:08:30,376 INFO L226 Difference]: Without dead ends: 5670 [2025-03-03 20:08:30,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:30,386 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 367 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:30,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1264 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2025-03-03 20:08:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 5666. [2025-03-03 20:08:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 4878 states have (on average 1.652111521115211) internal successors, (8059), 4909 states have internal predecessors, (8059), 755 states have call successors, (755), 32 states have call predecessors, (755), 32 states have return successors, (755), 724 states have call predecessors, (755), 755 states have call successors, (755) [2025-03-03 20:08:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 9569 transitions. [2025-03-03 20:08:30,632 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 9569 transitions. Word has length 662 [2025-03-03 20:08:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:30,633 INFO L471 AbstractCegarLoop]: Abstraction has 5666 states and 9569 transitions. [2025-03-03 20:08:30,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 9569 transitions. [2025-03-03 20:08:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:30,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:30,649 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:30,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1385808561, now seen corresponding path program 1 times [2025-03-03 20:08:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458646407] [2025-03-03 20:08:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:30,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:30,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:30,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:30,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458646407] [2025-03-03 20:08:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458646407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927712529] [2025-03-03 20:08:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:31,113 INFO L87 Difference]: Start difference. First operand 5666 states and 9569 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:31,314 INFO L93 Difference]: Finished difference Result 11353 states and 19171 transitions. [2025-03-03 20:08:31,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:31,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:31,343 INFO L225 Difference]: With dead ends: 11353 [2025-03-03 20:08:31,344 INFO L226 Difference]: Without dead ends: 5690 [2025-03-03 20:08:31,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:31,358 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 5 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:31,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1647 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2025-03-03 20:08:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5674. [2025-03-03 20:08:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 4886 states have (on average 1.651862464183381) internal successors, (8071), 4917 states have internal predecessors, (8071), 755 states have call successors, (755), 32 states have call predecessors, (755), 32 states have return successors, (755), 724 states have call predecessors, (755), 755 states have call successors, (755) [2025-03-03 20:08:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 9581 transitions. [2025-03-03 20:08:31,579 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 9581 transitions. Word has length 662 [2025-03-03 20:08:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:31,581 INFO L471 AbstractCegarLoop]: Abstraction has 5674 states and 9581 transitions. [2025-03-03 20:08:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 9581 transitions. [2025-03-03 20:08:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:31,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:31,592 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:08:31,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1740962480, now seen corresponding path program 1 times [2025-03-03 20:08:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380198935] [2025-03-03 20:08:31,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:31,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380198935] [2025-03-03 20:08:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380198935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114051959] [2025-03-03 20:08:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:32,053 INFO L87 Difference]: Start difference. First operand 5674 states and 9581 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:32,856 INFO L93 Difference]: Finished difference Result 22822 states and 37995 transitions. [2025-03-03 20:08:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:32,929 INFO L225 Difference]: With dead ends: 22822 [2025-03-03 20:08:32,929 INFO L226 Difference]: Without dead ends: 17151 [2025-03-03 20:08:32,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:32,946 INFO L435 NwaCegarLoop]: 1267 mSDtfsCounter, 981 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:32,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 3050 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17151 states. [2025-03-03 20:08:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17151 to 17143. [2025-03-03 20:08:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17143 states, 14050 states have (on average 1.5980071174377224) internal successors, (22452), 14176 states have internal predecessors, (22452), 2964 states have call successors, (2964), 128 states have call predecessors, (2964), 128 states have return successors, (2964), 2838 states have call predecessors, (2964), 2964 states have call successors, (2964) [2025-03-03 20:08:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17143 states to 17143 states and 28380 transitions. [2025-03-03 20:08:33,827 INFO L78 Accepts]: Start accepts. Automaton has 17143 states and 28380 transitions. Word has length 662 [2025-03-03 20:08:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:33,828 INFO L471 AbstractCegarLoop]: Abstraction has 17143 states and 28380 transitions. [2025-03-03 20:08:33,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17143 states and 28380 transitions. [2025-03-03 20:08:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:33,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:33,845 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:33,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:08:33,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:33,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:33,846 INFO L85 PathProgramCache]: Analyzing trace with hash 618344529, now seen corresponding path program 1 times [2025-03-03 20:08:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662289416] [2025-03-03 20:08:33,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:33,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:33,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:33,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:33,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:33,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:34,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:34,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662289416] [2025-03-03 20:08:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662289416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:34,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495040423] [2025-03-03 20:08:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:34,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:34,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:34,387 INFO L87 Difference]: Start difference. First operand 17143 states and 28380 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:35,753 INFO L93 Difference]: Finished difference Result 66043 states and 109167 transitions. [2025-03-03 20:08:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:36,060 INFO L225 Difference]: With dead ends: 66043 [2025-03-03 20:08:36,061 INFO L226 Difference]: Without dead ends: 48903 [2025-03-03 20:08:36,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:36,112 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 677 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:36,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1756 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48903 states. [2025-03-03 20:08:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48903 to 34519. [2025-03-03 20:08:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34519 states, 28522 states have (on average 1.6001682911436785) internal successors, (45640), 28776 states have internal predecessors, (45640), 5740 states have call successors, (5740), 256 states have call predecessors, (5740), 256 states have return successors, (5740), 5486 states have call predecessors, (5740), 5740 states have call successors, (5740) [2025-03-03 20:08:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34519 states to 34519 states and 57120 transitions. [2025-03-03 20:08:38,089 INFO L78 Accepts]: Start accepts. Automaton has 34519 states and 57120 transitions. Word has length 662 [2025-03-03 20:08:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:38,090 INFO L471 AbstractCegarLoop]: Abstraction has 34519 states and 57120 transitions. [2025-03-03 20:08:38,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34519 states and 57120 transitions. [2025-03-03 20:08:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:38,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:38,122 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:08:38,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:38,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash 176084905, now seen corresponding path program 1 times [2025-03-03 20:08:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:38,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547275560] [2025-03-03 20:08:38,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:38,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:38,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547275560] [2025-03-03 20:08:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547275560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:08:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166192133] [2025-03-03 20:08:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:08:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:39,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:08:39,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:39,751 INFO L87 Difference]: Start difference. First operand 34519 states and 57120 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:47,970 INFO L93 Difference]: Finished difference Result 201599 states and 333109 transitions. [2025-03-03 20:08:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:08:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:08:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:48,530 INFO L225 Difference]: With dead ends: 201599 [2025-03-03 20:08:48,530 INFO L226 Difference]: Without dead ends: 167083 [2025-03-03 20:08:48,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:08:48,641 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1534 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:48,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 4669 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 20:08:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167083 states. [2025-03-03 20:08:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167083 to 103563. [2025-03-03 20:08:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103563 states, 85794 states have (on average 1.6009511154626197) internal successors, (137352), 86558 states have internal predecessors, (137352), 17000 states have call successors, (17000), 768 states have call predecessors, (17000), 768 states have return successors, (17000), 16236 states have call predecessors, (17000), 17000 states have call successors, (17000) [2025-03-03 20:08:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103563 states to 103563 states and 171352 transitions. [2025-03-03 20:08:55,307 INFO L78 Accepts]: Start accepts. Automaton has 103563 states and 171352 transitions. Word has length 663 [2025-03-03 20:08:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:55,308 INFO L471 AbstractCegarLoop]: Abstraction has 103563 states and 171352 transitions. [2025-03-03 20:08:55,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 103563 states and 171352 transitions. [2025-03-03 20:08:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:55,377 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:08:55,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:08:55,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1513467870, now seen corresponding path program 1 times [2025-03-03 20:08:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289901287] [2025-03-03 20:08:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:55,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:55,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:55,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:55,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289901287] [2025-03-03 20:08:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289901287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127360595] [2025-03-03 20:08:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:55,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:55,979 INFO L87 Difference]: Start difference. First operand 103563 states and 171352 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:00,375 INFO L93 Difference]: Finished difference Result 205469 states and 339894 transitions. [2025-03-03 20:09:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:09:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:00,738 INFO L225 Difference]: With dead ends: 205469 [2025-03-03 20:09:00,738 INFO L226 Difference]: Without dead ends: 101909 [2025-03-03 20:09:00,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:00,888 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 373 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:00,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1033 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:09:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101909 states.