./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bbe82d9db46cc4877e8712955f17e418608577d83df9685a386a7b3e39c5f9b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:46:06,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:46:06,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:46:06,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:46:06,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:46:06,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:46:06,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:46:06,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:46:06,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:46:06,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:46:06,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:46:06,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:46:06,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:46:06,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:46:06,226 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:46:06,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:46:06,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:46:06,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:46:06,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:06,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:46:06,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:46:06,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:46:06,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:46:06,229 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-jdk21/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 -> bbe82d9db46cc4877e8712955f17e418608577d83df9685a386a7b3e39c5f9b9 [2025-02-06 02:46:06,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:46:06,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:46:06,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:46:06,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:46:06,519 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:46:06,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i [2025-02-06 02:46:07,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/706c70121/5e7af295d21f4a1a9ac999e535fd8559/FLAG54ca5631d [2025-02-06 02:46:08,226 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:46:08,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i [2025-02-06 02:46:08,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/706c70121/5e7af295d21f4a1a9ac999e535fd8559/FLAG54ca5631d [2025-02-06 02:46:08,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/706c70121/5e7af295d21f4a1a9ac999e535fd8559 [2025-02-06 02:46:08,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:46:08,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:46:08,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:08,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:46:08,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:46:08,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:08" (1/1) ... [2025-02-06 02:46:08,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669be90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:08, skipping insertion in model container [2025-02-06 02:46:08,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:08" (1/1) ... [2025-02-06 02:46:08,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:46:08,576 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i[916,929] [2025-02-06 02:46:08,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:08,883 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:46:08,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i[916,929] [2025-02-06 02:46:09,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:09,042 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:46:09,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09 WrapperNode [2025-02-06 02:46:09,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:09,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:09,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:46:09,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:46:09,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,195 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 732 [2025-02-06 02:46:09,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:09,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:46:09,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:46:09,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:46:09,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,355 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-02-06 02:46:09,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:46:09,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:46:09,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:46:09,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:46:09,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (1/1) ... [2025-02-06 02:46:09,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:09,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:46:09,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:46:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:46:09,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:46:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:46:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:46:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:46:09,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:46:09,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:46:09,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:46:10,798 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1;havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~short65#1; [2025-02-06 02:46:10,963 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 02:46:10,963 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:46:10,996 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:46:10,996 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:46:10,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:10 BoogieIcfgContainer [2025-02-06 02:46:10,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:46:10,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:46:10,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:46:11,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:46:11,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:46:08" (1/3) ... [2025-02-06 02:46:11,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777e3491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:11, skipping insertion in model container [2025-02-06 02:46:11,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:09" (2/3) ... [2025-02-06 02:46:11,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777e3491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:11, skipping insertion in model container [2025-02-06 02:46:11,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:10" (3/3) ... [2025-02-06 02:46:11,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-96.i [2025-02-06 02:46:11,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:46:11,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-96.i that has 2 procedures, 291 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:46:11,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:46:11,089 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;@4838d28f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:46:11,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:46:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 291 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 224 states have internal predecessors, (346), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:46:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-06 02:46:11,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:11,129 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:11,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:11,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1460885547, now seen corresponding path program 1 times [2025-02-06 02:46:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:11,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342691368] [2025-02-06 02:46:11,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:11,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:11,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:11,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-02-06 02:46:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342691368] [2025-02-06 02:46:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342691368] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024383275] [2025-02-06 02:46:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:11,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:11,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:46:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:46:12,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:12,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:12,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:12,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:12,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:46:12,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:12,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-02-06 02:46:12,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:46:12,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024383275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:12,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:46:12,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:46:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810850985] [2025-02-06 02:46:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:12,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:46:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:12,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:46:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:46:12,465 INFO L87 Difference]: Start difference. First operand has 291 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 224 states have internal predecessors, (346), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:46:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:12,568 INFO L93 Difference]: Finished difference Result 573 states and 1006 transitions. [2025-02-06 02:46:12,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:46:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 455 [2025-02-06 02:46:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:12,584 INFO L225 Difference]: With dead ends: 573 [2025-02-06 02:46:12,584 INFO L226 Difference]: Without dead ends: 285 [2025-02-06 02:46:12,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 456 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-02-06 02:46:12,598 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:12,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-06 02:46:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-02-06 02:46:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 02:46:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 461 transitions. [2025-02-06 02:46:12,692 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 461 transitions. Word has length 455 [2025-02-06 02:46:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 461 transitions. [2025-02-06 02:46:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:46:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 461 transitions. [2025-02-06 02:46:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-06 02:46:12,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:12,709 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:12,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:46:12,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:46:12,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:12,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1576633974, now seen corresponding path program 1 times [2025-02-06 02:46:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596395972] [2025-02-06 02:46:12,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:12,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:13,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:13,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:13,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:46:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596395972] [2025-02-06 02:46:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596395972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:13,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927654919] [2025-02-06 02:46:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:13,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:13,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:13,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:13,658 INFO L87 Difference]: Start difference. First operand 285 states and 461 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:13,836 INFO L93 Difference]: Finished difference Result 761 states and 1229 transitions. [2025-02-06 02:46:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-02-06 02:46:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:13,846 INFO L225 Difference]: With dead ends: 761 [2025-02-06 02:46:13,846 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 02:46:13,847 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-02-06 02:46:13,850 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 283 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:13,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1086 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 02:46:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2025-02-06 02:46:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 388 states have (on average 1.541237113402062) internal successors, (598), 389 states have internal predecessors, (598), 85 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (85), 84 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-06 02:46:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 768 transitions. [2025-02-06 02:46:13,914 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 768 transitions. Word has length 455 [2025-02-06 02:46:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 768 transitions. [2025-02-06 02:46:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 768 transitions. [2025-02-06 02:46:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-06 02:46:13,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:13,922 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:13,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:46:13,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -467818775, now seen corresponding path program 1 times [2025-02-06 02:46:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002674270] [2025-02-06 02:46:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:13,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:14,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:46:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002674270] [2025-02-06 02:46:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002674270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:14,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292713004] [2025-02-06 02:46:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:14,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:14,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:14,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:14,437 INFO L87 Difference]: Start difference. First operand 476 states and 768 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:14,615 INFO L93 Difference]: Finished difference Result 1372 states and 2213 transitions. [2025-02-06 02:46:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:14,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-02-06 02:46:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:14,625 INFO L225 Difference]: With dead ends: 1372 [2025-02-06 02:46:14,626 INFO L226 Difference]: Without dead ends: 899 [2025-02-06 02:46:14,627 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-02-06 02:46:14,629 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 344 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:14,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 869 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-02-06 02:46:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 896. [2025-02-06 02:46:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 742 states have (on average 1.54177897574124) internal successors, (1144), 745 states have internal predecessors, (1144), 149 states have call successors, (149), 4 states have call predecessors, (149), 4 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 02:46:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1442 transitions. [2025-02-06 02:46:14,712 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1442 transitions. Word has length 455 [2025-02-06 02:46:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:14,714 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1442 transitions. [2025-02-06 02:46:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1442 transitions. [2025-02-06 02:46:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-06 02:46:14,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:14,721 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:14,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:46:14,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:14,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2126408042, now seen corresponding path program 1 times [2025-02-06 02:46:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:14,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063156347] [2025-02-06 02:46:14,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:46:15,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:15,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063156347] [2025-02-06 02:46:15,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063156347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:15,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519468263] [2025-02-06 02:46:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:15,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:15,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:15,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:15,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:15,870 INFO L87 Difference]: Start difference. First operand 896 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:16,060 INFO L93 Difference]: Finished difference Result 2674 states and 4312 transitions. [2025-02-06 02:46:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-02-06 02:46:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:16,076 INFO L225 Difference]: With dead ends: 2674 [2025-02-06 02:46:16,077 INFO L226 Difference]: Without dead ends: 1781 [2025-02-06 02:46:16,083 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-02-06 02:46:16,084 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 320 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:16,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 961 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-02-06 02:46:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1779. [2025-02-06 02:46:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1472 states have (on average 1.5326086956521738) internal successors, (2256), 1478 states have internal predecessors, (2256), 298 states have call successors, (298), 8 states have call predecessors, (298), 8 states have return successors, (298), 292 states have call predecessors, (298), 298 states have call successors, (298) [2025-02-06 02:46:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2852 transitions. [2025-02-06 02:46:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2852 transitions. Word has length 455 [2025-02-06 02:46:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2852 transitions. [2025-02-06 02:46:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2852 transitions. [2025-02-06 02:46:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-06 02:46:16,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:16,270 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:16,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:46:16,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 6120843, now seen corresponding path program 1 times [2025-02-06 02:46:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:16,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595766277] [2025-02-06 02:46:16,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:16,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:16,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-06 02:46:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-06 02:46:16,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:46:17,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595766277] [2025-02-06 02:46:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595766277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:17,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974082228] [2025-02-06 02:46:17,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:17,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:17,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:17,340 INFO L87 Difference]: Start difference. First operand 1779 states and 2852 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:18,440 INFO L93 Difference]: Finished difference Result 4434 states and 7129 transitions. [2025-02-06 02:46:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-02-06 02:46:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:18,467 INFO L225 Difference]: With dead ends: 4434 [2025-02-06 02:46:18,467 INFO L226 Difference]: Without dead ends: 3541 [2025-02-06 02:46:18,472 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-02-06 02:46:18,473 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 733 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:18,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2311 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:46:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-02-06 02:46:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2674. [2025-02-06 02:46:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2214 states have (on average 1.5266485998193315) internal successors, (3380), 2223 states have internal predecessors, (3380), 447 states have call successors, (447), 12 states have call predecessors, (447), 12 states have return successors, (447), 438 states have call predecessors, (447), 447 states have call successors, (447) [2025-02-06 02:46:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 4274 transitions. [2025-02-06 02:46:18,718 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 4274 transitions. Word has length 455 [2025-02-06 02:46:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 4274 transitions. [2025-02-06 02:46:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:46:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 4274 transitions. [2025-02-06 02:46:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:46:18,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:18,729 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:46:18,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:18,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2067224049, now seen corresponding path program 1 times [2025-02-06 02:46:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852416819] [2025-02-06 02:46:18,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:18,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:18,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:46:19,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:46:19,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:19,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:46:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852416819] [2025-02-06 02:46:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852416819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241723704] [2025-02-06 02:46:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:21,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:21,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:21,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:21,703 INFO L87 Difference]: Start difference. First operand 2674 states and 4274 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:46:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:23,512 INFO L93 Difference]: Finished difference Result 7395 states and 11774 transitions. [2025-02-06 02:46:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:23,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 456 [2025-02-06 02:46:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:23,548 INFO L225 Difference]: With dead ends: 7395 [2025-02-06 02:46:23,548 INFO L226 Difference]: Without dead ends: 4724 [2025-02-06 02:46:23,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:46:23,560 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 686 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:23,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1157 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:46:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2025-02-06 02:46:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4716. [2025-02-06 02:46:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4716 states, 3968 states have (on average 1.5206653225806452) internal successors, (6034), 3989 states have internal predecessors, (6034), 723 states have call successors, (723), 24 states have call predecessors, (723), 24 states have return successors, (723), 702 states have call predecessors, (723), 723 states have call successors, (723) [2025-02-06 02:46:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 7480 transitions. [2025-02-06 02:46:23,891 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 7480 transitions. Word has length 456 [2025-02-06 02:46:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:23,892 INFO L471 AbstractCegarLoop]: Abstraction has 4716 states and 7480 transitions. [2025-02-06 02:46:23,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:46:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 7480 transitions. [2025-02-06 02:46:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:46:23,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:23,926 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:46:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:46:23,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:23,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1262870862, now seen corresponding path program 1 times [2025-02-06 02:46:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359125615] [2025-02-06 02:46:23,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:23,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:46:24,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:46:24,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:24,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:47:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:02,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359125615] [2025-02-06 02:47:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359125615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:02,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:47:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674139743] [2025-02-06 02:47:02,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:47:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:47:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:47:02,806 INFO L87 Difference]: Start difference. First operand 4716 states and 7480 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-02-06 02:47:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:05,392 INFO L93 Difference]: Finished difference Result 11479 states and 18186 transitions. [2025-02-06 02:47:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:47:05,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 456 [2025-02-06 02:47:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:05,438 INFO L225 Difference]: With dead ends: 11479 [2025-02-06 02:47:05,438 INFO L226 Difference]: Without dead ends: 6766 [2025-02-06 02:47:05,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:47:05,453 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 854 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:05,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1305 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 02:47:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6766 states. [2025-02-06 02:47:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6766 to 4716. [2025-02-06 02:47:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4716 states, 3968 states have (on average 1.5206653225806452) internal successors, (6034), 3989 states have internal predecessors, (6034), 723 states have call successors, (723), 24 states have call predecessors, (723), 24 states have return successors, (723), 702 states have call predecessors, (723), 723 states have call successors, (723) [2025-02-06 02:47:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 7480 transitions. [2025-02-06 02:47:05,810 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 7480 transitions. Word has length 456 [2025-02-06 02:47:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 4716 states and 7480 transitions. [2025-02-06 02:47:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2025-02-06 02:47:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 7480 transitions. [2025-02-06 02:47:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-06 02:47:05,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:05,827 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:47:05,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:47:05,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:05,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1363782829, now seen corresponding path program 1 times [2025-02-06 02:47:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191923436] [2025-02-06 02:47:05,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:05,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-06 02:47:06,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-06 02:47:06,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:06,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:47:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191923436] [2025-02-06 02:47:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191923436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:06,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:47:06,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142446495] [2025-02-06 02:47:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:47:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:06,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:47:06,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:47:06,685 INFO L87 Difference]: Start difference. First operand 4716 states and 7480 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:07,369 INFO L93 Difference]: Finished difference Result 15964 states and 25203 transitions. [2025-02-06 02:47:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:47:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-02-06 02:47:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:07,447 INFO L225 Difference]: With dead ends: 15964 [2025-02-06 02:47:07,448 INFO L226 Difference]: Without dead ends: 11251 [2025-02-06 02:47:07,467 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-02-06 02:47:07,468 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 599 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:07,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1434 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:47:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11251 states. [2025-02-06 02:47:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11251 to 9427. [2025-02-06 02:47:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 7932 states have (on average 1.5194150277357539) internal successors, (12052), 7974 states have internal predecessors, (12052), 1446 states have call successors, (1446), 48 states have call predecessors, (1446), 48 states have return successors, (1446), 1404 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-02-06 02:47:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14944 transitions. [2025-02-06 02:47:08,195 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14944 transitions. Word has length 456 [2025-02-06 02:47:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 9427 states and 14944 transitions. [2025-02-06 02:47:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14944 transitions. [2025-02-06 02:47:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-06 02:47:08,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:08,209 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:47:08,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:47:08,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:08,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1821916413, now seen corresponding path program 1 times [2025-02-06 02:47:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911879568] [2025-02-06 02:47:08,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:08,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:08,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-06 02:47:08,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-06 02:47:08,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:08,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:47:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911879568] [2025-02-06 02:47:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911879568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:47:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926424514] [2025-02-06 02:47:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:10,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:47:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:10,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:47:10,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:47:10,043 INFO L87 Difference]: Start difference. First operand 9427 states and 14944 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:11,567 INFO L93 Difference]: Finished difference Result 32797 states and 51982 transitions. [2025-02-06 02:47:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:47:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-02-06 02:47:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:11,651 INFO L225 Difference]: With dead ends: 32797 [2025-02-06 02:47:11,652 INFO L226 Difference]: Without dead ends: 23373 [2025-02-06 02:47:11,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:47:11,674 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 1363 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:11,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1960 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:47:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23373 states. [2025-02-06 02:47:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23373 to 15983. [2025-02-06 02:47:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15983 states, 14080 states have (on average 1.548224431818182) internal successors, (21799), 14146 states have internal predecessors, (21799), 1830 states have call successors, (1830), 72 states have call predecessors, (1830), 72 states have return successors, (1830), 1764 states have call predecessors, (1830), 1830 states have call successors, (1830) [2025-02-06 02:47:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15983 states to 15983 states and 25459 transitions. [2025-02-06 02:47:12,660 INFO L78 Accepts]: Start accepts. Automaton has 15983 states and 25459 transitions. Word has length 457 [2025-02-06 02:47:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:12,662 INFO L471 AbstractCegarLoop]: Abstraction has 15983 states and 25459 transitions. [2025-02-06 02:47:12,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15983 states and 25459 transitions. [2025-02-06 02:47:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-06 02:47:12,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:12,686 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:47:12,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:47:12,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1409823459, now seen corresponding path program 1 times [2025-02-06 02:47:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868698022] [2025-02-06 02:47:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:12,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-06 02:47:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-06 02:47:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:47:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:12,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868698022] [2025-02-06 02:47:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868698022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:47:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045051898] [2025-02-06 02:47:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:47:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:12,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:47:12,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:47:12,962 INFO L87 Difference]: Start difference. First operand 15983 states and 25459 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:13,839 INFO L93 Difference]: Finished difference Result 33663 states and 53760 transitions. [2025-02-06 02:47:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:47:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-02-06 02:47:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:13,903 INFO L225 Difference]: With dead ends: 33663 [2025-02-06 02:47:13,903 INFO L226 Difference]: Without dead ends: 17683 [2025-02-06 02:47:13,938 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-02-06 02:47:13,938 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 265 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1086 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:47:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17683 states. [2025-02-06 02:47:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17683 to 13715. [2025-02-06 02:47:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13715 states, 12694 states have (on average 1.5986292736726013) internal successors, (20293), 12724 states have internal predecessors, (20293), 978 states have call successors, (978), 42 states have call predecessors, (978), 42 states have return successors, (978), 948 states have call predecessors, (978), 978 states have call successors, (978) [2025-02-06 02:47:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13715 states to 13715 states and 22249 transitions. [2025-02-06 02:47:14,612 INFO L78 Accepts]: Start accepts. Automaton has 13715 states and 22249 transitions. Word has length 457 [2025-02-06 02:47:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:14,613 INFO L471 AbstractCegarLoop]: Abstraction has 13715 states and 22249 transitions. [2025-02-06 02:47:14,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-02-06 02:47:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13715 states and 22249 transitions. [2025-02-06 02:47:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-06 02:47:14,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:14,629 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:47:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:47:14,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:14,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1701796540, now seen corresponding path program 1 times [2025-02-06 02:47:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:14,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677810437] [2025-02-06 02:47:14,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:14,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:14,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-06 02:47:14,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-06 02:47:14,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-06 02:47:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677810437] [2025-02-06 02:47:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677810437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:15,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:47:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079464050] [2025-02-06 02:47:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:15,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:47:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:15,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:47:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:47:15,350 INFO L87 Difference]: Start difference. First operand 13715 states and 22249 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:47:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:15,978 INFO L93 Difference]: Finished difference Result 27535 states and 44711 transitions. [2025-02-06 02:47:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:47:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 457 [2025-02-06 02:47:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:16,023 INFO L225 Difference]: With dead ends: 27535 [2025-02-06 02:47:16,023 INFO L226 Difference]: Without dead ends: 13823 [2025-02-06 02:47:16,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:47:16,043 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 373 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:16,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1261 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:47:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2025-02-06 02:47:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 13823. [2025-02-06 02:47:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13823 states, 12802 states have (on average 1.5935791282612093) internal successors, (20401), 12832 states have internal predecessors, (20401), 978 states have call successors, (978), 42 states have call predecessors, (978), 42 states have return successors, (978), 948 states have call predecessors, (978), 978 states have call successors, (978) [2025-02-06 02:47:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13823 states to 13823 states and 22357 transitions. [2025-02-06 02:47:16,752 INFO L78 Accepts]: Start accepts. Automaton has 13823 states and 22357 transitions. Word has length 457 [2025-02-06 02:47:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:16,753 INFO L471 AbstractCegarLoop]: Abstraction has 13823 states and 22357 transitions. [2025-02-06 02:47:16,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-02-06 02:47:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 13823 states and 22357 transitions. [2025-02-06 02:47:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-06 02:47:16,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:16,771 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:47:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:47:16,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 818795284, now seen corresponding path program 1 times [2025-02-06 02:47:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645390295] [2025-02-06 02:47:16,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:16,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:16,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-06 02:47:17,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-06 02:47:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat