./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-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-pr-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 19ddd5d3e870010456648368aac7f13027e543c029bb47d44edea54e5df0ea2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:56:08,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:56:08,065 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:56:08,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:56:08,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:56:08,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:56:08,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:56:08,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:56:08,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:56:08,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:56:08,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:56:08,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:56:08,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:56:08,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:56:08,095 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:56:08,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:56:08,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:56:08,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:56:08,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:56:08,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:56:08,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:56:08,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:56:08,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:56:08,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:56:08,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:56:08,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:56:08,098 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 -> 19ddd5d3e870010456648368aac7f13027e543c029bb47d44edea54e5df0ea2e [2025-02-05 22:56:08,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:56:08,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:56:08,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:56:08,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:56:08,327 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:56:08,327 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-pr-ci_file-34.i [2025-02-05 22:56:09,443 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d2e68a00/d8187bd76d4443b5b1477f805d924c61/FLAG0bf74cbba [2025-02-05 22:56:09,715 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:56:09,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i [2025-02-05 22:56:09,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d2e68a00/d8187bd76d4443b5b1477f805d924c61/FLAG0bf74cbba [2025-02-05 22:56:09,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d2e68a00/d8187bd76d4443b5b1477f805d924c61 [2025-02-05 22:56:09,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:56:09,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:56:09,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:56:09,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:56:09,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:56:09,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:09,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d25dcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09, skipping insertion in model container [2025-02-05 22:56:09,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:09,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:56:09,862 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-pr-ci_file-34.i[919,932] [2025-02-05 22:56:09,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:56:09,934 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:56:09,943 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-pr-ci_file-34.i[919,932] [2025-02-05 22:56:09,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:56:09,981 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:56:09,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09 WrapperNode [2025-02-05 22:56:09,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:56:09,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:56:09,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:56:09,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:56:09,987 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:56:09" (1/1) ... [2025-02-05 22:56:09,993 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:56:09" (1/1) ... [2025-02-05 22:56:10,019 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-02-05 22:56:10,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:56:10,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:56:10,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:56:10,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:56:10,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,056 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:56:10,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:56:10,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:56:10,066 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:56:10,066 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:56:10,067 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (1/1) ... [2025-02-05 22:56:10,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:56:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:56:10,102 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:56:10,111 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:56:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:56:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:56:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:56:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:56:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:56:10,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:56:10,177 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:56:10,178 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:56:10,487 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:56:10,522 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 22:56:10,523 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:56:10,546 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:56:10,549 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:56:10,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:56:10 BoogieIcfgContainer [2025-02-05 22:56:10,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:56:10,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:56:10,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:56:10,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:56:10,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:56:09" (1/3) ... [2025-02-05 22:56:10,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1150eb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:56:10, skipping insertion in model container [2025-02-05 22:56:10,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:56:09" (2/3) ... [2025-02-05 22:56:10,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1150eb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:56:10, skipping insertion in model container [2025-02-05 22:56:10,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:56:10" (3/3) ... [2025-02-05 22:56:10,559 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i [2025-02-05 22:56:10,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:56:10,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:56:10,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:56:10,637 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;@4f01e20d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:56:10,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:56:10,642 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:56:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 22:56:10,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:10,652 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:56:10,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1764167056, now seen corresponding path program 1 times [2025-02-05 22:56:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942422425] [2025-02-05 22:56:10,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:10,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:56:10,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:56:10,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:10,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:10,933 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:56:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942422425] [2025-02-05 22:56:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942422425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:56:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648507709] [2025-02-05 22:56:10,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:10,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:56:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:56:10,941 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:56:10,942 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:56:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:56:11,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:56:11,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:11,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:11,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:56:11,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:56:11,103 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:56:11,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:56:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648507709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:11,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:56:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:56:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628049690] [2025-02-05 22:56:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:56:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:56:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:56:11,124 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:56:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:11,159 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-02-05 22:56:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:56:11,161 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:56:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:11,165 INFO L225 Difference]: With dead ends: 178 [2025-02-05 22:56:11,165 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 22:56:11,167 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:56:11,169 INFO L435 NwaCegarLoop]: 134 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, 134 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:56:11,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:56:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 22:56:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 22:56:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 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:56:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-02-05 22:56:11,199 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 141 [2025-02-05 22:56:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:11,203 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-02-05 22:56:11,203 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:56:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-02-05 22:56:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 22:56:11,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:11,205 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:56:11,220 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:56:11,410 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:56:11,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1154477774, now seen corresponding path program 1 times [2025-02-05 22:56:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024266326] [2025-02-05 22:56:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:11,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 22:56:11,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 22:56:11,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:11,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:11,830 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:56:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024266326] [2025-02-05 22:56:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024266326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:56:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452679257] [2025-02-05 22:56:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:11,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:56:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:11,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:56:11,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:56:11,834 INFO L87 Difference]: Start difference. First operand 89 states and 138 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:56:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:11,980 INFO L93 Difference]: Finished difference Result 301 states and 471 transitions. [2025-02-05 22:56:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:56:11,980 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:56:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:11,983 INFO L225 Difference]: With dead ends: 301 [2025-02-05 22:56:11,983 INFO L226 Difference]: Without dead ends: 215 [2025-02-05 22:56:11,984 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:56:11,984 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 165 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 436 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:11,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 436 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:56:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-05 22:56:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 183. [2025-02-05 22:56:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 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:56:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 288 transitions. [2025-02-05 22:56:12,019 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 288 transitions. Word has length 141 [2025-02-05 22:56:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 288 transitions. [2025-02-05 22:56:12,020 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:56:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 288 transitions. [2025-02-05 22:56:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 22:56:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:12,021 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:56:12,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:56:12,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:12,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1278937971, now seen corresponding path program 1 times [2025-02-05 22:56:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012075327] [2025-02-05 22:56:12,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:12,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 22:56:12,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 22:56:12,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:12,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:12,286 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:56:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012075327] [2025-02-05 22:56:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012075327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:56:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916364533] [2025-02-05 22:56:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:56:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:12,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:56:12,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:56:12,289 INFO L87 Difference]: Start difference. First operand 183 states and 288 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:56:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:12,527 INFO L93 Difference]: Finished difference Result 534 states and 841 transitions. [2025-02-05 22:56:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:56:12,527 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:56:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:12,529 INFO L225 Difference]: With dead ends: 534 [2025-02-05 22:56:12,531 INFO L226 Difference]: Without dead ends: 354 [2025-02-05 22:56:12,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:56:12,533 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 175 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:12,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 512 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:56:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-05 22:56:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 187. [2025-02-05 22:56:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 144 states have internal predecessors, (212), 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:56:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2025-02-05 22:56:12,551 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 142 [2025-02-05 22:56:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:12,552 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2025-02-05 22:56:12,552 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:56:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2025-02-05 22:56:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:12,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:12,553 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:56:12,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:56:12,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:12,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -930236786, now seen corresponding path program 1 times [2025-02-05 22:56:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960857415] [2025-02-05 22:56:12,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:12,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:12,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:12,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:12,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:14,757 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:56:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960857415] [2025-02-05 22:56:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960857415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:56:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85132807] [2025-02-05 22:56:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:14,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:56:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:14,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:56:14,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:56:14,761 INFO L87 Difference]: Start difference. First operand 187 states and 292 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:56:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:15,374 INFO L93 Difference]: Finished difference Result 568 states and 879 transitions. [2025-02-05 22:56:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:56:15,374 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:56:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:15,377 INFO L225 Difference]: With dead ends: 568 [2025-02-05 22:56:15,377 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 22:56:15,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:56:15,378 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:15,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 434 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:56:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 22:56:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 266. [2025-02-05 22:56:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 202 states have (on average 1.4653465346534653) internal successors, (296), 202 states have internal predecessors, (296), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:56:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 416 transitions. [2025-02-05 22:56:15,402 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 416 transitions. Word has length 143 [2025-02-05 22:56:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 416 transitions. [2025-02-05 22:56:15,402 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:56:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 416 transitions. [2025-02-05 22:56:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:15,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:15,405 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:56:15,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:56:15,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:15,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1815155817, now seen corresponding path program 1 times [2025-02-05 22:56:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283098149] [2025-02-05 22:56:15,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:15,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:15,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:15,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:34,161 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:56:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283098149] [2025-02-05 22:56:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283098149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 22:56:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942300587] [2025-02-05 22:56:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:56:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:34,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:56:34,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:56:34,163 INFO L87 Difference]: Start difference. First operand 266 states and 416 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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:56:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:36,909 INFO L93 Difference]: Finished difference Result 770 states and 1172 transitions. [2025-02-05 22:56:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 22:56:36,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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:56:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:36,915 INFO L225 Difference]: With dead ends: 770 [2025-02-05 22:56:36,916 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 22:56:36,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2025-02-05 22:56:36,918 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 602 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:36,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 960 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 22:56:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 22:56:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 380. [2025-02-05 22:56:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 316 states have (on average 1.4715189873417722) internal successors, (465), 316 states have internal predecessors, (465), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:56:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 585 transitions. [2025-02-05 22:56:36,947 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 585 transitions. Word has length 143 [2025-02-05 22:56:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:36,948 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 585 transitions. [2025-02-05 22:56:36,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 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:56:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 585 transitions. [2025-02-05 22:56:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:36,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:36,949 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:56:36,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:56:36,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1592307798, now seen corresponding path program 1 times [2025-02-05 22:56:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:36,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140095371] [2025-02-05 22:56:36,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:36,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:38,385 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:56:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140095371] [2025-02-05 22:56:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140095371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:56:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786153568] [2025-02-05 22:56:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:56:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:38,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:56:38,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:56:38,388 INFO L87 Difference]: Start difference. First operand 380 states and 585 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:56:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:39,349 INFO L93 Difference]: Finished difference Result 850 states and 1300 transitions. [2025-02-05 22:56:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:56:39,349 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:56:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:39,352 INFO L225 Difference]: With dead ends: 850 [2025-02-05 22:56:39,354 INFO L226 Difference]: Without dead ends: 618 [2025-02-05 22:56:39,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:56:39,356 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 429 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:39,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 522 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:56:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-05 22:56:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 448. [2025-02-05 22:56:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 384 states have (on average 1.4635416666666667) internal successors, (562), 384 states have internal predecessors, (562), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:56:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 682 transitions. [2025-02-05 22:56:39,392 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 682 transitions. Word has length 143 [2025-02-05 22:56:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:39,393 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 682 transitions. [2025-02-05 22:56:39,393 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:56:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 682 transitions. [2025-02-05 22:56:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:39,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:39,394 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:56:39,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:56:39,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 7701354, now seen corresponding path program 1 times [2025-02-05 22:56:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659011521] [2025-02-05 22:56:39,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:39,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:41,338 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:56:41,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:41,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659011521] [2025-02-05 22:56:41,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659011521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:41,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:56:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082287226] [2025-02-05 22:56:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:41,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:56:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:41,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:56:41,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:56:41,341 INFO L87 Difference]: Start difference. First operand 448 states and 682 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:56:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:42,322 INFO L93 Difference]: Finished difference Result 790 states and 1193 transitions. [2025-02-05 22:56:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:56:42,325 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:56:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:42,328 INFO L225 Difference]: With dead ends: 790 [2025-02-05 22:56:42,328 INFO L226 Difference]: Without dead ends: 588 [2025-02-05 22:56:42,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:56:42,329 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 399 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:42,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 501 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:56:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-05 22:56:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 467. [2025-02-05 22:56:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 403 states have (on average 1.468982630272953) internal successors, (592), 403 states have internal predecessors, (592), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:56:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 712 transitions. [2025-02-05 22:56:42,351 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 712 transitions. Word has length 143 [2025-02-05 22:56:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:42,351 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 712 transitions. [2025-02-05 22:56:42,352 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:56:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 712 transitions. [2025-02-05 22:56:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:42,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:42,353 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:56:42,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:56:42,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1440770963, now seen corresponding path program 1 times [2025-02-05 22:56:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764230465] [2025-02-05 22:56:42,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:42,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:42,555 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:56:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764230465] [2025-02-05 22:56:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764230465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:56:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479681299] [2025-02-05 22:56:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:56:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:56:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:56:42,557 INFO L87 Difference]: Start difference. First operand 467 states and 712 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:56:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:42,768 INFO L93 Difference]: Finished difference Result 711 states and 1086 transitions. [2025-02-05 22:56:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:56:42,768 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:56:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:42,770 INFO L225 Difference]: With dead ends: 711 [2025-02-05 22:56:42,770 INFO L226 Difference]: Without dead ends: 459 [2025-02-05 22:56:42,771 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:56:42,772 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 98 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:42,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 332 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:56:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-05 22:56:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 431. [2025-02-05 22:56:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 367 states have (on average 1.44141689373297) internal successors, (529), 367 states have internal predecessors, (529), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:56:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 649 transitions. [2025-02-05 22:56:42,801 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 649 transitions. Word has length 143 [2025-02-05 22:56:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:42,804 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 649 transitions. [2025-02-05 22:56:42,804 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:56:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 649 transitions. [2025-02-05 22:56:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 22:56:42,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:42,805 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:56:42,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:56:42,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash -222900472, now seen corresponding path program 1 times [2025-02-05 22:56:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581123893] [2025-02-05 22:56:42,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 22:56:42,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 22:56:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:44,559 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:56:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:44,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581123893] [2025-02-05 22:56:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581123893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:44,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:56:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858960781] [2025-02-05 22:56:44,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:44,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:56:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:44,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:56:44,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:56:44,563 INFO L87 Difference]: Start difference. First operand 431 states and 649 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:56:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:46,859 INFO L93 Difference]: Finished difference Result 980 states and 1483 transitions. [2025-02-05 22:56:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:56:46,860 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:56:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:46,865 INFO L225 Difference]: With dead ends: 980 [2025-02-05 22:56:46,866 INFO L226 Difference]: Without dead ends: 892 [2025-02-05 22:56:46,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-02-05 22:56:46,868 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 477 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:46,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1385 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 22:56:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-02-05 22:56:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 783. [2025-02-05 22:56:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 656 states have (on average 1.4466463414634145) internal successors, (949), 656 states have internal predecessors, (949), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-05 22:56:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2025-02-05 22:56:46,917 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 143 [2025-02-05 22:56:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2025-02-05 22:56:46,917 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:56:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2025-02-05 22:56:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:56:46,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:46,920 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:56:46,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:56:46,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:46,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 846666217, now seen corresponding path program 1 times [2025-02-05 22:56:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:56:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943564063] [2025-02-05 22:56:46,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:56:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:56:46,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:56:46,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:46,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:59,532 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:56:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:56:59,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943564063] [2025-02-05 22:56:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943564063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:56:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:56:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:56:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385010578] [2025-02-05 22:56:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:56:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:56:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:56:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:56:59,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:56:59,536 INFO L87 Difference]: Start difference. First operand 783 states and 1189 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:57:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:57:00,133 INFO L93 Difference]: Finished difference Result 1344 states and 2013 transitions. [2025-02-05 22:57:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:57:00,134 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:57:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:57:00,138 INFO L225 Difference]: With dead ends: 1344 [2025-02-05 22:57:00,139 INFO L226 Difference]: Without dead ends: 1160 [2025-02-05 22:57:00,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:57:00,140 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 243 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:57:00,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 928 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:57:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-02-05 22:57:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 933. [2025-02-05 22:57:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 797 states have (on average 1.4416562107904642) internal successors, (1149), 798 states have internal predecessors, (1149), 125 states have call successors, (125), 10 states have call predecessors, (125), 10 states have return successors, (125), 124 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-05 22:57:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1399 transitions. [2025-02-05 22:57:00,182 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1399 transitions. Word has length 144 [2025-02-05 22:57:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:57:00,183 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1399 transitions. [2025-02-05 22:57:00,183 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:57:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1399 transitions. [2025-02-05 22:57:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:57:00,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:57:00,185 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:57:00,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:57:00,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:57:00,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:57:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2091430698, now seen corresponding path program 1 times [2025-02-05 22:57:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:57:00,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445568173] [2025-02-05 22:57:00,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:57:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:57:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:57:00,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:57:00,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:57:00,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:57:01,100 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:57:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:57:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445568173] [2025-02-05 22:57:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445568173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:57:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:57:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:57:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017384032] [2025-02-05 22:57:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:57:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:57:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:57:01,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:57:01,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:57:01,102 INFO L87 Difference]: Start difference. First operand 933 states and 1399 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:57:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:57:01,830 INFO L93 Difference]: Finished difference Result 1287 states and 1922 transitions. [2025-02-05 22:57:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:57:01,831 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:57:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:57:01,835 INFO L225 Difference]: With dead ends: 1287 [2025-02-05 22:57:01,835 INFO L226 Difference]: Without dead ends: 1138 [2025-02-05 22:57:01,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 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:57:01,837 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 263 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:57:01,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1322 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:57:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-05 22:57:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 996. [2025-02-05 22:57:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 844 states have (on average 1.4348341232227488) internal successors, (1211), 844 states have internal predecessors, (1211), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 22:57:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1491 transitions. [2025-02-05 22:57:01,890 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1491 transitions. Word has length 144 [2025-02-05 22:57:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:57:01,890 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1491 transitions. [2025-02-05 22:57:01,890 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:57:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1491 transitions. [2025-02-05 22:57:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:57:01,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:57:01,892 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:57:01,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:57:01,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:57:01,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:57:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -599347424, now seen corresponding path program 1 times [2025-02-05 22:57:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:57:01,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250934677] [2025-02-05 22:57:01,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:57:01,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:57:01,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:57:01,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:57:01,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:57:01,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:57:05,348 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:57:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:57:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250934677] [2025-02-05 22:57:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250934677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:57:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:57:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:57:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541037691] [2025-02-05 22:57:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:57:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:57:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:57:05,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:57:05,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:57:05,350 INFO L87 Difference]: Start difference. First operand 996 states and 1491 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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:57:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:57:07,261 INFO L93 Difference]: Finished difference Result 1768 states and 2658 transitions. [2025-02-05 22:57:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:57:07,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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:57:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:57:07,266 INFO L225 Difference]: With dead ends: 1768 [2025-02-05 22:57:07,266 INFO L226 Difference]: Without dead ends: 1155 [2025-02-05 22:57:07,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:57:07,268 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 415 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:57:07,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 654 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:57:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-05 22:57:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1008. [2025-02-05 22:57:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 856 states have (on average 1.4310747663551402) internal successors, (1225), 856 states have internal predecessors, (1225), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 22:57:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1505 transitions. [2025-02-05 22:57:07,320 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1505 transitions. Word has length 144 [2025-02-05 22:57:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:57:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1505 transitions. [2025-02-05 22:57:07,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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:57:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1505 transitions. [2025-02-05 22:57:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:57:07,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:57:07,322 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:57:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:57:07,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:57:07,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:57:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1888165409, now seen corresponding path program 1 times [2025-02-05 22:57:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:57:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867857575] [2025-02-05 22:57:07,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:57:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:57:07,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:57:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:57:07,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:57:07,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:57:21,267 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:57:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:57:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867857575] [2025-02-05 22:57:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867857575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:57:21,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:57:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 22:57:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434185867] [2025-02-05 22:57:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:57:21,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:57:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:57:21,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:57:21,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:57:21,270 INFO L87 Difference]: Start difference. First operand 1008 states and 1505 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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:57:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:57:23,138 INFO L93 Difference]: Finished difference Result 1736 states and 2608 transitions. [2025-02-05 22:57:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:57:23,139 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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:57:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:57:23,145 INFO L225 Difference]: With dead ends: 1736 [2025-02-05 22:57:23,145 INFO L226 Difference]: Without dead ends: 1119 [2025-02-05 22:57:23,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:57:23,147 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 334 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:57:23,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1022 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:57:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-02-05 22:57:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1026. [2025-02-05 22:57:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 874 states have (on average 1.429061784897025) internal successors, (1249), 874 states have internal predecessors, (1249), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 22:57:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1529 transitions. [2025-02-05 22:57:23,191 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1529 transitions. Word has length 144 [2025-02-05 22:57:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:57:23,192 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1529 transitions. [2025-02-05 22:57:23,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 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:57:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1529 transitions. [2025-02-05 22:57:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 22:57:23,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:57:23,194 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:57:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:57:23,194 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:57:23,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:57:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -149890880, now seen corresponding path program 1 times [2025-02-05 22:57:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:57:23,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559038735] [2025-02-05 22:57:23,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:57:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:57:23,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 22:57:23,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 22:57:23,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:57:23,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:57:35,958 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:57:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:57:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559038735] [2025-02-05 22:57:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559038735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:57:35,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:57:35,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:57:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984756692] [2025-02-05 22:57:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:57:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:57:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:57:35,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:57:35,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:57:35,960 INFO L87 Difference]: Start difference. First operand 1026 states and 1529 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:57:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:57:37,267 INFO L93 Difference]: Finished difference Result 2477 states and 3714 transitions. [2025-02-05 22:57:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:57:37,267 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:57:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:57:37,273 INFO L225 Difference]: With dead ends: 2477 [2025-02-05 22:57:37,273 INFO L226 Difference]: Without dead ends: 1717 [2025-02-05 22:57:37,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:57:37,275 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 367 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:57:37,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1095 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:57:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-02-05 22:57:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1388. [2025-02-05 22:57:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1236 states have (on average 1.4619741100323624) internal successors, (1807), 1236 states have internal predecessors, (1807), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-05 22:57:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2087 transitions. [2025-02-05 22:57:37,328 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2087 transitions. Word has length 144 [2025-02-05 22:57:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:57:37,329 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2087 transitions. [2025-02-05 22:57:37,330 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:57:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2087 transitions. [2025-02-05 22:57:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 22:57:37,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:57:37,332 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, 1] [2025-02-05 22:57:37,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:57:37,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:57:37,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:57:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1010591091, now seen corresponding path program 1 times [2025-02-05 22:57:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:57:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130195450] [2025-02-05 22:57:37,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:57:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:57:37,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 22:57:37,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 22:57:37,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:57:37,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat