./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.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_fillercode_fillercodestructure_filler-pe-ci_file-34.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 c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:18:54,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:18:55,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:18:55,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:18:55,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:18:55,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:18:55,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:18:55,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:18:55,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:18:55,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:18:55,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:18:55,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:18:55,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:18:55,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:18:55,108 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:18:55,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:18:55,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:18:55,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:18:55,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:18:55,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:18:55,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:55,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:18:55,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:18:55,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:18:55,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:18:55,112 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 -> c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 [2025-02-05 22:18:55,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:18:55,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:18:55,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:18:55,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:18:55,408 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:18:55,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-02-05 22:18:56,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d6254a4b/4111789fc50d41e781b2e6ca4020360e/FLAG5211a55e6 [2025-02-05 22:18:57,055 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:18:57,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-02-05 22:18:57,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d6254a4b/4111789fc50d41e781b2e6ca4020360e/FLAG5211a55e6 [2025-02-05 22:18:57,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d6254a4b/4111789fc50d41e781b2e6ca4020360e [2025-02-05 22:18:57,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:18:57,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:18:57,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:57,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:18:57,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:18:57,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f532e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57, skipping insertion in model container [2025-02-05 22:18:57,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:18:57,266 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_fillercode_fillercodestructure_filler-pe-ci_file-34.i[919,932] [2025-02-05 22:18:57,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:57,343 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:18:57,351 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_fillercode_fillercodestructure_filler-pe-ci_file-34.i[919,932] [2025-02-05 22:18:57,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:57,405 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:18:57,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57 WrapperNode [2025-02-05 22:18:57,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:57,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:57,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:18:57,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:18:57,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,455 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-02-05 22:18:57,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:57,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:18:57,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:18:57,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:18:57,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,490 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-05 22:18:57,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:18:57,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:18:57,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:18:57,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:18:57,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (1/1) ... [2025-02-05 22:18:57,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:57,546 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-05 22:18:57,552 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-05 22:18:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:18:57,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:18:57,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:18:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:18:57,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:18:57,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:18:57,656 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:18:57,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:18:58,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-02-05 22:18:58,110 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 22:18:58,110 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:18:58,135 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:18:58,135 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:18:58,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:58 BoogieIcfgContainer [2025-02-05 22:18:58,136 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:18:58,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:18:58,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:18:58,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:18:58,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:18:57" (1/3) ... [2025-02-05 22:18:58,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af5a928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:58, skipping insertion in model container [2025-02-05 22:18:58,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:57" (2/3) ... [2025-02-05 22:18:58,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af5a928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:58, skipping insertion in model container [2025-02-05 22:18:58,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:58" (3/3) ... [2025-02-05 22:18:58,145 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-02-05 22:18:58,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:18:58,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:18:58,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:18:58,225 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;@2a1ed8f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:18:58,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:18:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 22:18:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 22:18:58,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:58,241 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:18:58,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:58,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash 694429323, now seen corresponding path program 1 times [2025-02-05 22:18:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369561096] [2025-02-05 22:18:58,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:58,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:18:58,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:18:58,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:58,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-05 22:18:58,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369561096] [2025-02-05 22:18:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369561096] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678239295] [2025-02-05 22:18:58,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:58,611 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-05 22:18:58,612 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-05 22:18:58,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:18:58,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:18:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:58,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:18:58,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-05 22:18:58,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:18:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678239295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:58,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:18:58,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:18:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604351792] [2025-02-05 22:18:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:58,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:18:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:58,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:18:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:58,813 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 22:18:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:58,855 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-02-05 22:18:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:18:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-02-05 22:18:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:58,864 INFO L225 Difference]: With dead ends: 178 [2025-02-05 22:18:58,865 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 22:18:58,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-05 22:18:58,872 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:58,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:18:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 22:18:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 22:18:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 22:18:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-02-05 22:18:58,923 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 141 [2025-02-05 22:18:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:58,923 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-02-05 22:18:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 22:18:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-02-05 22:18:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 22:18:58,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:58,927 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:18:58,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:18:59,127 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-05 22:18:59,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:59,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2070751789, now seen corresponding path program 1 times [2025-02-05 22:18:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:59,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788620135] [2025-02-05 22:18:59,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:18:59,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:18:59,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:59,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:18:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788620135] [2025-02-05 22:18:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788620135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:18:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814971784] [2025-02-05 22:18:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:18:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:59,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:18:59,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:18:59,763 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:18:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:59,995 INFO L93 Difference]: Finished difference Result 301 states and 475 transitions. [2025-02-05 22:18:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:18:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-02-05 22:18:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:59,998 INFO L225 Difference]: With dead ends: 301 [2025-02-05 22:19:00,000 INFO L226 Difference]: Without dead ends: 215 [2025-02-05 22:19:00,001 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-05 22:19:00,001 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 172 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:00,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 440 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-05 22:19:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2025-02-05 22:19:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 22:19:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-02-05 22:19:00,053 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 141 [2025-02-05 22:19:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:00,053 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-02-05 22:19:00,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-02-05 22:19:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 22:19:00,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:00,056 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:00,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:19:00,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:00,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1172491934, now seen corresponding path program 1 times [2025-02-05 22:19:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175225179] [2025-02-05 22:19:00,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 22:19:00,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 22:19:00,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:00,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175225179] [2025-02-05 22:19:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175225179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:00,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:19:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593077249] [2025-02-05 22:19:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:00,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:19:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:00,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:19:00,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:19:00,493 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:00,830 INFO L93 Difference]: Finished difference Result 514 states and 808 transitions. [2025-02-05 22:19:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:19:00,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-02-05 22:19:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:00,834 INFO L225 Difference]: With dead ends: 514 [2025-02-05 22:19:00,834 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 22:19:00,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:19:00,836 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 222 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:00,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 385 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:19:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 22:19:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 179. [2025-02-05 22:19:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 22:19:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2025-02-05 22:19:00,885 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 142 [2025-02-05 22:19:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:00,885 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2025-02-05 22:19:00,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2025-02-05 22:19:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:00,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:00,893 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:00,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:19:00,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:00,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -951702571, now seen corresponding path program 1 times [2025-02-05 22:19:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786634768] [2025-02-05 22:19:00,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:00,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:01,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:01,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:01,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786634768] [2025-02-05 22:19:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786634768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:18,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:19:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599988493] [2025-02-05 22:19:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:18,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:19:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:18,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:19:18,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:19:18,938 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:20,581 INFO L93 Difference]: Finished difference Result 701 states and 1091 transitions. [2025-02-05 22:19:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:19:20,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:20,586 INFO L225 Difference]: With dead ends: 701 [2025-02-05 22:19:20,588 INFO L226 Difference]: Without dead ends: 525 [2025-02-05 22:19:20,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:19:20,590 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 528 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:20,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 776 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 22:19:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-05 22:19:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 304. [2025-02-05 22:19:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.4899598393574298) internal successors, (371), 251 states have internal predecessors, (371), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 22:19:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 471 transitions. [2025-02-05 22:19:20,626 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 471 transitions. Word has length 143 [2025-02-05 22:19:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:20,626 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 471 transitions. [2025-02-05 22:19:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 471 transitions. [2025-02-05 22:19:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:20,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:20,629 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:20,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:19:20,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1457261196, now seen corresponding path program 1 times [2025-02-05 22:19:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981209853] [2025-02-05 22:19:20,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:20,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:20,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:20,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981209853] [2025-02-05 22:19:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981209853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:19:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438012773] [2025-02-05 22:19:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:19:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:23,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:19:23,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:19:23,122 INFO L87 Difference]: Start difference. First operand 304 states and 471 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:24,313 INFO L93 Difference]: Finished difference Result 1155 states and 1802 transitions. [2025-02-05 22:19:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:24,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:24,321 INFO L225 Difference]: With dead ends: 1155 [2025-02-05 22:19:24,324 INFO L226 Difference]: Without dead ends: 854 [2025-02-05 22:19:24,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:19:24,326 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 550 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:24,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 487 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:19:24,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-02-05 22:19:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 416. [2025-02-05 22:19:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 340 states have (on average 1.4441176470588235) internal successors, (491), 342 states have internal predecessors, (491), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 22:19:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2025-02-05 22:19:24,382 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 143 [2025-02-05 22:19:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2025-02-05 22:19:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2025-02-05 22:19:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:24,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:24,386 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:19:24,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1462236748, now seen corresponding path program 1 times [2025-02-05 22:19:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:24,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652384950] [2025-02-05 22:19:24,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:24,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:24,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:24,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:26,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652384950] [2025-02-05 22:19:26,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652384950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:26,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:19:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953218235] [2025-02-05 22:19:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:19:26,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:26,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:19:26,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:19:26,615 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:27,691 INFO L93 Difference]: Finished difference Result 1255 states and 1919 transitions. [2025-02-05 22:19:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:27,698 INFO L225 Difference]: With dead ends: 1255 [2025-02-05 22:19:27,698 INFO L226 Difference]: Without dead ends: 887 [2025-02-05 22:19:27,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:19:27,701 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 412 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:27,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 550 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:19:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-05 22:19:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 717. [2025-02-05 22:19:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 643 states have internal predecessors, (970), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 22:19:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1110 transitions. [2025-02-05 22:19:27,759 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1110 transitions. Word has length 143 [2025-02-05 22:19:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:27,759 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1110 transitions. [2025-02-05 22:19:27,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1110 transitions. [2025-02-05 22:19:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:27,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:27,763 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:27,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:19:27,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:27,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1923430896, now seen corresponding path program 1 times [2025-02-05 22:19:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890627907] [2025-02-05 22:19:27,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:27,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:27,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:27,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:27,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:27,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890627907] [2025-02-05 22:19:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890627907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:19:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507893490] [2025-02-05 22:19:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:29,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:19:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:29,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:19:29,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:19:29,419 INFO L87 Difference]: Start difference. First operand 717 states and 1110 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:29,913 INFO L93 Difference]: Finished difference Result 1356 states and 2106 transitions. [2025-02-05 22:19:29,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:19:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:29,920 INFO L225 Difference]: With dead ends: 1356 [2025-02-05 22:19:29,920 INFO L226 Difference]: Without dead ends: 963 [2025-02-05 22:19:29,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:19:29,922 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 270 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:29,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 497 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:19:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-02-05 22:19:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 721. [2025-02-05 22:19:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 645 states have (on average 1.5054263565891473) internal successors, (971), 647 states have internal predecessors, (971), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 22:19:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1111 transitions. [2025-02-05 22:19:29,972 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1111 transitions. Word has length 143 [2025-02-05 22:19:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1111 transitions. [2025-02-05 22:19:29,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1111 transitions. [2025-02-05 22:19:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:29,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:29,974 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:19:29,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:29,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -740351658, now seen corresponding path program 1 times [2025-02-05 22:19:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:29,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290594576] [2025-02-05 22:19:29,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:29,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:30,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:30,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290594576] [2025-02-05 22:19:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290594576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:19:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045725648] [2025-02-05 22:19:30,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:30,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:19:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:30,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:19:30,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:19:30,252 INFO L87 Difference]: Start difference. First operand 721 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:30,494 INFO L93 Difference]: Finished difference Result 1176 states and 1824 transitions. [2025-02-05 22:19:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:19:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:30,498 INFO L225 Difference]: With dead ends: 1176 [2025-02-05 22:19:30,498 INFO L226 Difference]: Without dead ends: 699 [2025-02-05 22:19:30,499 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-05 22:19:30,500 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 338 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-05 22:19:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 645. [2025-02-05 22:19:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 569 states have (on average 1.476274165202109) internal successors, (840), 571 states have internal predecessors, (840), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 22:19:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 980 transitions. [2025-02-05 22:19:30,537 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 980 transitions. Word has length 143 [2025-02-05 22:19:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 980 transitions. [2025-02-05 22:19:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 980 transitions. [2025-02-05 22:19:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:19:30,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:30,542 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:30,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:19:30,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:30,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 293061910, now seen corresponding path program 1 times [2025-02-05 22:19:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550237703] [2025-02-05 22:19:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:19:30,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:19:30,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:30,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:35,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550237703] [2025-02-05 22:19:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550237703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:35,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:35,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:19:35,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243613120] [2025-02-05 22:19:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:19:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:35,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:19:35,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:19:35,481 INFO L87 Difference]: Start difference. First operand 645 states and 980 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:37,726 INFO L93 Difference]: Finished difference Result 928 states and 1400 transitions. [2025-02-05 22:19:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:19:37,728 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-02-05 22:19:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:37,734 INFO L225 Difference]: With dead ends: 928 [2025-02-05 22:19:37,734 INFO L226 Difference]: Without dead ends: 762 [2025-02-05 22:19:37,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:19:37,736 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 399 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:37,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 916 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 22:19:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-02-05 22:19:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 660. [2025-02-05 22:19:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 584 states have (on average 1.4743150684931507) internal successors, (861), 586 states have internal predecessors, (861), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 22:19:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1001 transitions. [2025-02-05 22:19:37,784 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1001 transitions. Word has length 143 [2025-02-05 22:19:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:37,785 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1001 transitions. [2025-02-05 22:19:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1001 transitions. [2025-02-05 22:19:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:19:37,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:37,788 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:37,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:19:37,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:37,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 872466022, now seen corresponding path program 1 times [2025-02-05 22:19:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840385116] [2025-02-05 22:19:37,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:19:37,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:19:37,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:50,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840385116] [2025-02-05 22:19:50,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840385116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:50,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:19:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119698] [2025-02-05 22:19:50,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:50,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:19:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:50,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:19:50,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:19:50,567 INFO L87 Difference]: Start difference. First operand 660 states and 1001 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:51,242 INFO L93 Difference]: Finished difference Result 1522 states and 2367 transitions. [2025-02-05 22:19:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-02-05 22:19:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:51,247 INFO L225 Difference]: With dead ends: 1522 [2025-02-05 22:19:51,247 INFO L226 Difference]: Without dead ends: 1171 [2025-02-05 22:19:51,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:19:51,249 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 419 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:51,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 881 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:19:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-05 22:19:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 642. [2025-02-05 22:19:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 571 states have (on average 1.4711033274956218) internal successors, (840), 572 states have internal predecessors, (840), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-05 22:19:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2025-02-05 22:19:51,289 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 144 [2025-02-05 22:19:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:51,289 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2025-02-05 22:19:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2025-02-05 22:19:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:19:51,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:51,291 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:51,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:19:51,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:51,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 805459269, now seen corresponding path program 1 times [2025-02-05 22:19:51,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906790026] [2025-02-05 22:19:51,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:19:51,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:19:51,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:51,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:19:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906790026] [2025-02-05 22:19:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906790026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:19:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424269695] [2025-02-05 22:19:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:19:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:52,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:19:52,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:19:52,533 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:53,260 INFO L93 Difference]: Finished difference Result 1058 states and 1625 transitions. [2025-02-05 22:19:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:53,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-02-05 22:19:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:53,264 INFO L225 Difference]: With dead ends: 1058 [2025-02-05 22:19:53,264 INFO L226 Difference]: Without dead ends: 872 [2025-02-05 22:19:53,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:19:53,266 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 440 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:53,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1105 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:19:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-02-05 22:19:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 732. [2025-02-05 22:19:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 645 states have (on average 1.4651162790697674) internal successors, (945), 645 states have internal predecessors, (945), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 22:19:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1105 transitions. [2025-02-05 22:19:53,308 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1105 transitions. Word has length 144 [2025-02-05 22:19:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:53,308 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1105 transitions. [2025-02-05 22:19:53,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:19:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1105 transitions. [2025-02-05 22:19:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:19:53,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:53,310 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:19:53,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:19:53,311 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:53,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 418227307, now seen corresponding path program 1 times [2025-02-05 22:19:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704314685] [2025-02-05 22:19:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:53,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:19:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:19:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:20:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 22:20:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:20:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704314685] [2025-02-05 22:20:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704314685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:20:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:20:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:20:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841830541] [2025-02-05 22:20:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:20:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:20:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:20:01,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:20:01,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:20:01,592 INFO L87 Difference]: Start difference. First operand 732 states and 1105 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:20:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:20:03,247 INFO L93 Difference]: Finished difference Result 1689 states and 2554 transitions. [2025-02-05 22:20:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 22:20:03,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-02-05 22:20:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:20:03,251 INFO L225 Difference]: With dead ends: 1689 [2025-02-05 22:20:03,252 INFO L226 Difference]: Without dead ends: 1079 [2025-02-05 22:20:03,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:20:03,254 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:20:03,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 892 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:20:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-02-05 22:20:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 880. [2025-02-05 22:20:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 793 states have (on average 1.4867591424968474) internal successors, (1179), 793 states have internal predecessors, (1179), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 22:20:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1339 transitions. [2025-02-05 22:20:03,299 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1339 transitions. Word has length 144 [2025-02-05 22:20:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:20:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1339 transitions. [2025-02-05 22:20:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 22:20:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1339 transitions. [2025-02-05 22:20:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:20:03,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:20:03,302 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:20:03,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:20:03,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:20:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:20:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2121441331, now seen corresponding path program 1 times [2025-02-05 22:20:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:20:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643042986] [2025-02-05 22:20:03,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:20:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:20:03,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:20:03,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:20:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:20:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat