./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d296a3302a6844401d5af73ebf4532ddc45e3bc6fc59b524170709cbc547ff4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:50:15,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:50:15,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:50:15,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:50:15,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:50:15,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:50:15,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:50:15,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:50:15,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:50:15,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:50:15,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:50:15,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:50:15,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:50:15,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:50:15,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:50:15,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:50:15,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:50:15,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:50:15,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:50:15,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:50:15,093 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d296a3302a6844401d5af73ebf4532ddc45e3bc6fc59b524170709cbc547ff4 [2025-03-03 20:50:15,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:50:15,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:50:15,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:50:15,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:50:15,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:50:15,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-03-03 20:50:16,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ddf9611/b56f89da76b647f981c983a519ea7751/FLAG09366b5e2 [2025-03-03 20:50:16,696 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:50:16,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-03-03 20:50:16,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ddf9611/b56f89da76b647f981c983a519ea7751/FLAG09366b5e2 [2025-03-03 20:50:16,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ddf9611/b56f89da76b647f981c983a519ea7751 [2025-03-03 20:50:16,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:50:16,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:50:16,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:50:16,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:50:16,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:50:16,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:16,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16, skipping insertion in model container [2025-03-03 20:50:16,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:16,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:50:16,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i[918,931] [2025-03-03 20:50:16,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:50:16,924 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:50:16,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i[918,931] [2025-03-03 20:50:16,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:50:16,965 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:50:16,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16 WrapperNode [2025-03-03 20:50:16,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:50:16,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:50:16,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:50:16,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:50:16,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:16,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:16,999 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-03-03 20:50:17,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:50:17,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:50:17,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:50:17,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:50:17,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,020 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:50:17,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:50:17,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:50:17,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:50:17,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:50:17,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (1/1) ... [2025-03-03 20:50:17,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:50:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:17,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:50:17,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:50:17,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:50:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:50:17,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:50:17,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:50:17,155 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:50:17,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:50:17,503 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-03-03 20:50:17,532 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:50:17,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:50:17,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:50:17,548 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:50:17,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:50:17 BoogieIcfgContainer [2025-03-03 20:50:17,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:50:17,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:50:17,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:50:17,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:50:17,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:50:16" (1/3) ... [2025-03-03 20:50:17,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e91afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:50:17, skipping insertion in model container [2025-03-03 20:50:17,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:50:16" (2/3) ... [2025-03-03 20:50:17,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e91afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:50:17, skipping insertion in model container [2025-03-03 20:50:17,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:50:17" (3/3) ... [2025-03-03 20:50:17,556 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-03-03 20:50:17,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:50:17,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:50:17,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:50:17,617 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;@19c2f81a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:50:17,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:50:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:50:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 20:50:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:17,631 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:17,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:17,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -858152115, now seen corresponding path program 1 times [2025-03-03 20:50:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:17,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302611104] [2025-03-03 20:50:17,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:17,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 20:50:17,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 20:50:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:50:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302611104] [2025-03-03 20:50:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302611104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:50:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048170922] [2025-03-03 20:50:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:17,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:17,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:50:17,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:50:17,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 20:50:18,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 20:50:18,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:18,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:18,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:50:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 20:50:18,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:50:18,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048170922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:18,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:50:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:50:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815286317] [2025-03-03 20:50:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:50:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:18,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:50:18,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:50:18,144 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:50:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:18,175 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-03-03 20:50:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:50:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-03-03 20:50:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:18,181 INFO L225 Difference]: With dead ends: 238 [2025-03-03 20:50:18,181 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 20:50:18,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:50:18,185 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:18,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:50:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 20:50:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 20:50:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:50:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2025-03-03 20:50:18,216 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 221 [2025-03-03 20:50:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:18,217 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2025-03-03 20:50:18,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 20:50:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2025-03-03 20:50:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 20:50:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:18,220 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:18,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:50:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:50:18,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1725055729, now seen corresponding path program 1 times [2025-03-03 20:50:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235219813] [2025-03-03 20:50:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:18,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 20:50:18,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 20:50:18,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:18,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235219813] [2025-03-03 20:50:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235219813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:50:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685156778] [2025-03-03 20:50:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:18,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:50:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:18,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:50:18,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:18,778 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:18,961 INFO L93 Difference]: Finished difference Result 352 states and 566 transitions. [2025-03-03 20:50:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:50:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-03-03 20:50:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:18,965 INFO L225 Difference]: With dead ends: 352 [2025-03-03 20:50:18,966 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 20:50:18,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:18,969 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 116 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:18,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 458 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:50:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 20:50:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2025-03-03 20:50:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:50:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions. [2025-03-03 20:50:19,007 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 221 [2025-03-03 20:50:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:19,009 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 375 transitions. [2025-03-03 20:50:19,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions. [2025-03-03 20:50:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 20:50:19,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:19,014 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:19,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:50:19,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:19,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1583004866, now seen corresponding path program 1 times [2025-03-03 20:50:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:19,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-03-03 20:50:19,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:19,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 20:50:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 20:50:19,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:19,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:19,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:19,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509225115] [2025-03-03 20:50:19,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509225115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:19,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:19,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:50:19,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545920523] [2025-03-03 20:50:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:19,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:50:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:19,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:50:19,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:19,157 INFO L87 Difference]: Start difference. First operand 233 states and 375 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:19,245 INFO L93 Difference]: Finished difference Result 679 states and 1098 transitions. [2025-03-03 20:50:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:50:19,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-03-03 20:50:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:19,252 INFO L225 Difference]: With dead ends: 679 [2025-03-03 20:50:19,253 INFO L226 Difference]: Without dead ends: 449 [2025-03-03 20:50:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:19,255 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 179 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:19,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 340 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:50:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-03 20:50:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-03-03 20:50:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 20:50:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 719 transitions. [2025-03-03 20:50:19,312 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 719 transitions. Word has length 222 [2025-03-03 20:50:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:19,312 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 719 transitions. [2025-03-03 20:50:19,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 719 transitions. [2025-03-03 20:50:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 20:50:19,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:19,317 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:19,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:50:19,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:19,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1789759711, now seen corresponding path program 1 times [2025-03-03 20:50:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:19,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327429231] [2025-03-03 20:50:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:19,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 20:50:19,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 20:50:19,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:19,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327429231] [2025-03-03 20:50:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327429231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:19,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:19,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:50:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150170240] [2025-03-03 20:50:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:50:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:19,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:50:19,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:19,493 INFO L87 Difference]: Start difference. First operand 447 states and 719 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:19,656 INFO L93 Difference]: Finished difference Result 895 states and 1440 transitions. [2025-03-03 20:50:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:50:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-03-03 20:50:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:19,660 INFO L225 Difference]: With dead ends: 895 [2025-03-03 20:50:19,660 INFO L226 Difference]: Without dead ends: 451 [2025-03-03 20:50:19,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:50:19,661 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:19,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 459 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:50:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-03 20:50:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-03-03 20:50:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 306 states have (on average 1.457516339869281) internal successors, (446), 306 states have internal predecessors, (446), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-03 20:50:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 718 transitions. [2025-03-03 20:50:19,694 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 718 transitions. Word has length 222 [2025-03-03 20:50:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:19,694 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 718 transitions. [2025-03-03 20:50:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 718 transitions. [2025-03-03 20:50:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 20:50:19,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:19,696 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:50:19,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:19,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 949301820, now seen corresponding path program 1 times [2025-03-03 20:50:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:19,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920026113] [2025-03-03 20:50:19,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:19,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 20:50:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 20:50:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:19,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:19,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920026113] [2025-03-03 20:50:19,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920026113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:19,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:50:19,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850864437] [2025-03-03 20:50:19,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:19,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:50:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:19,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:50:19,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:19,918 INFO L87 Difference]: Start difference. First operand 447 states and 718 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:20,017 INFO L93 Difference]: Finished difference Result 1335 states and 2148 transitions. [2025-03-03 20:50:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:50:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-03-03 20:50:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:20,025 INFO L225 Difference]: With dead ends: 1335 [2025-03-03 20:50:20,025 INFO L226 Difference]: Without dead ends: 891 [2025-03-03 20:50:20,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:20,031 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 120 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:20,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 391 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:50:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-03 20:50:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2025-03-03 20:50:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 608 states have (on average 1.4407894736842106) internal successors, (876), 608 states have internal predecessors, (876), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-03 20:50:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1420 transitions. [2025-03-03 20:50:20,132 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1420 transitions. Word has length 223 [2025-03-03 20:50:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:20,135 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1420 transitions. [2025-03-03 20:50:20,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1420 transitions. [2025-03-03 20:50:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 20:50:20,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:20,138 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:20,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:50:20,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1322179193, now seen corresponding path program 1 times [2025-03-03 20:50:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339112362] [2025-03-03 20:50:20,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:20,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 20:50:20,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 20:50:20,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:20,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339112362] [2025-03-03 20:50:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339112362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:50:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816900911] [2025-03-03 20:50:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:20,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:50:20,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:50:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:20,242 INFO L87 Difference]: Start difference. First operand 889 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:20,324 INFO L93 Difference]: Finished difference Result 2185 states and 3486 transitions. [2025-03-03 20:50:20,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:50:20,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-03 20:50:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:20,334 INFO L225 Difference]: With dead ends: 2185 [2025-03-03 20:50:20,334 INFO L226 Difference]: Without dead ends: 1299 [2025-03-03 20:50:20,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:20,338 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 83 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:20,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 417 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:50:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-03 20:50:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 961. [2025-03-03 20:50:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 680 states have (on average 1.4411764705882353) internal successors, (980), 680 states have internal predecessors, (980), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-03 20:50:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1524 transitions. [2025-03-03 20:50:20,441 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1524 transitions. Word has length 224 [2025-03-03 20:50:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:20,442 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1524 transitions. [2025-03-03 20:50:20,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1524 transitions. [2025-03-03 20:50:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 20:50:20,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:20,447 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:20,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:50:20,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:20,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1977122778, now seen corresponding path program 1 times [2025-03-03 20:50:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:20,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84853311] [2025-03-03 20:50:20,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:20,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 20:50:20,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 20:50:20,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:20,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:20,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84853311] [2025-03-03 20:50:20,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84853311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:20,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:20,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:50:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206419391] [2025-03-03 20:50:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:20,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:50:20,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:20,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:50:20,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:20,626 INFO L87 Difference]: Start difference. First operand 961 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:21,086 INFO L93 Difference]: Finished difference Result 3341 states and 5309 transitions. [2025-03-03 20:50:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:50:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-03 20:50:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:21,099 INFO L225 Difference]: With dead ends: 3341 [2025-03-03 20:50:21,099 INFO L226 Difference]: Without dead ends: 2383 [2025-03-03 20:50:21,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:50:21,103 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 420 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:21,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 452 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:50:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-03 20:50:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2379. [2025-03-03 20:50:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1678 states have (on average 1.4266984505363527) internal successors, (2394), 1678 states have internal predecessors, (2394), 680 states have call successors, (680), 20 states have call predecessors, (680), 20 states have return successors, (680), 680 states have call predecessors, (680), 680 states have call successors, (680) [2025-03-03 20:50:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3754 transitions. [2025-03-03 20:50:21,283 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3754 transitions. Word has length 224 [2025-03-03 20:50:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3754 transitions. [2025-03-03 20:50:21,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3754 transitions. [2025-03-03 20:50:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 20:50:21,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:21,287 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:21,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:50:21,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:21,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1320772165, now seen corresponding path program 1 times [2025-03-03 20:50:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:21,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323013006] [2025-03-03 20:50:21,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:21,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 20:50:21,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 20:50:21,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:50:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323013006] [2025-03-03 20:50:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323013006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:50:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183417095] [2025-03-03 20:50:21,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:21,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:50:21,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:50:21,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 20:50:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 20:50:21,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:21,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:21,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 20:50:21,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-03-03 20:50:22,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:50:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:50:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183417095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:50:22,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:50:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-03 20:50:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625498489] [2025-03-03 20:50:22,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:50:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:50:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:50:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:50:22,754 INFO L87 Difference]: Start difference. First operand 2379 states and 3754 transitions. Second operand has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-03 20:50:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:24,878 INFO L93 Difference]: Finished difference Result 17689 states and 27890 transitions. [2025-03-03 20:50:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:50:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 224 [2025-03-03 20:50:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:24,958 INFO L225 Difference]: With dead ends: 17689 [2025-03-03 20:50:24,958 INFO L226 Difference]: Without dead ends: 15313 [2025-03-03 20:50:24,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:50:24,970 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1089 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:24,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2084 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:50:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2025-03-03 20:50:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 8339. [2025-03-03 20:50:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8339 states, 5778 states have (on average 1.3970231914157147) internal successors, (8072), 5798 states have internal predecessors, (8072), 2460 states have call successors, (2460), 100 states have call predecessors, (2460), 100 states have return successors, (2460), 2440 states have call predecessors, (2460), 2460 states have call successors, (2460) [2025-03-03 20:50:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 12992 transitions. [2025-03-03 20:50:25,898 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 12992 transitions. Word has length 224 [2025-03-03 20:50:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:25,899 INFO L471 AbstractCegarLoop]: Abstraction has 8339 states and 12992 transitions. [2025-03-03 20:50:25,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-03 20:50:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 12992 transitions. [2025-03-03 20:50:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 20:50:25,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:25,903 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:25,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:50:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 20:50:26,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:26,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1561360952, now seen corresponding path program 1 times [2025-03-03 20:50:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778483223] [2025-03-03 20:50:26,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:26,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 20:50:26,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 20:50:26,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:26,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-03-03 20:50:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778483223] [2025-03-03 20:50:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778483223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:50:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974936326] [2025-03-03 20:50:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:27,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:27,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:50:27,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:50:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 20:50:27,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 20:50:27,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:27,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:27,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 20:50:27,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1201 proven. 75 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 20:50:28,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:50:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 117 proven. 78 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2025-03-03 20:50:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974936326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:50:29,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:50:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 24 [2025-03-03 20:50:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973525617] [2025-03-03 20:50:29,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:50:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 20:50:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:29,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 20:50:29,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-03-03 20:50:29,002 INFO L87 Difference]: Start difference. First operand 8339 states and 12992 transitions. Second operand has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-03 20:50:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:35,342 INFO L93 Difference]: Finished difference Result 34799 states and 51074 transitions. [2025-03-03 20:50:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-03 20:50:35,343 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 225 [2025-03-03 20:50:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:35,443 INFO L225 Difference]: With dead ends: 34799 [2025-03-03 20:50:35,443 INFO L226 Difference]: Without dead ends: 26463 [2025-03-03 20:50:35,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6607 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3408, Invalid=12594, Unknown=0, NotChecked=0, Total=16002 [2025-03-03 20:50:35,484 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4669 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 1172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1172 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:35,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 1732 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1172 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 20:50:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26463 states. [2025-03-03 20:50:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26463 to 20827. [2025-03-03 20:50:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20827 states, 15938 states have (on average 1.374450997615761) internal successors, (21906), 16138 states have internal predecessors, (21906), 4190 states have call successors, (4190), 698 states have call predecessors, (4190), 698 states have return successors, (4190), 3990 states have call predecessors, (4190), 4190 states have call successors, (4190) [2025-03-03 20:50:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20827 states to 20827 states and 30286 transitions. [2025-03-03 20:50:37,300 INFO L78 Accepts]: Start accepts. Automaton has 20827 states and 30286 transitions. Word has length 225 [2025-03-03 20:50:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 20827 states and 30286 transitions. [2025-03-03 20:50:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-03 20:50:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20827 states and 30286 transitions. [2025-03-03 20:50:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 20:50:37,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:37,308 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:37,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:50:37,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:37,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1111368125, now seen corresponding path program 1 times [2025-03-03 20:50:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332274483] [2025-03-03 20:50:37,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:37,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 20:50:37,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 20:50:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332274483] [2025-03-03 20:50:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332274483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:37,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:37,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:50:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361431156] [2025-03-03 20:50:37,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:37,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:50:37,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:37,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:50:37,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:50:37,694 INFO L87 Difference]: Start difference. First operand 20827 states and 30286 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:40,045 INFO L93 Difference]: Finished difference Result 45015 states and 65598 transitions. [2025-03-03 20:50:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:50:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-03-03 20:50:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:40,169 INFO L225 Difference]: With dead ends: 45015 [2025-03-03 20:50:40,170 INFO L226 Difference]: Without dead ends: 34489 [2025-03-03 20:50:40,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:50:40,198 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 187 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:40,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 833 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:50:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34489 states. [2025-03-03 20:50:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34489 to 34459. [2025-03-03 20:50:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34459 states, 26030 states have (on average 1.3682289665770264) internal successors, (35615), 26382 states have internal predecessors, (35615), 7230 states have call successors, (7230), 1198 states have call predecessors, (7230), 1198 states have return successors, (7230), 6878 states have call predecessors, (7230), 7230 states have call successors, (7230) [2025-03-03 20:50:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34459 states to 34459 states and 50075 transitions. [2025-03-03 20:50:43,371 INFO L78 Accepts]: Start accepts. Automaton has 34459 states and 50075 transitions. Word has length 226 [2025-03-03 20:50:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:43,372 INFO L471 AbstractCegarLoop]: Abstraction has 34459 states and 50075 transitions. [2025-03-03 20:50:43,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34459 states and 50075 transitions. [2025-03-03 20:50:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 20:50:43,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:43,380 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:50:43,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1901597500, now seen corresponding path program 1 times [2025-03-03 20:50:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120262310] [2025-03-03 20:50:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 20:50:43,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 20:50:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 57 proven. 135 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-03-03 20:50:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120262310] [2025-03-03 20:50:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120262310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:50:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261129647] [2025-03-03 20:50:44,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:44,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:44,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:50:44,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:50:44,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:50:44,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 20:50:44,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 20:50:44,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:44,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:44,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 20:50:44,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:50:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1256 proven. 192 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2025-03-03 20:50:45,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:50:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 201 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-03-03 20:50:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261129647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:50:46,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:50:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2025-03-03 20:50:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685000755] [2025-03-03 20:50:46,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:50:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 20:50:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:46,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 20:50:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-03 20:50:46,118 INFO L87 Difference]: Start difference. First operand 34459 states and 50075 transitions. Second operand has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2025-03-03 20:50:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:48,930 INFO L93 Difference]: Finished difference Result 56218 states and 80557 transitions. [2025-03-03 20:50:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 20:50:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) Word has length 226 [2025-03-03 20:50:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:49,032 INFO L225 Difference]: With dead ends: 56218 [2025-03-03 20:50:49,033 INFO L226 Difference]: Without dead ends: 21762 [2025-03-03 20:50:49,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=619, Invalid=1361, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 20:50:49,105 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1184 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:49,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 482 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:50:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states. [2025-03-03 20:50:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 20113. [2025-03-03 20:50:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20113 states, 15232 states have (on average 1.34046743697479) internal successors, (20418), 15438 states have internal predecessors, (20418), 3990 states have call successors, (3990), 890 states have call predecessors, (3990), 890 states have return successors, (3990), 3784 states have call predecessors, (3990), 3990 states have call successors, (3990) [2025-03-03 20:50:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20113 states to 20113 states and 28398 transitions. [2025-03-03 20:50:51,616 INFO L78 Accepts]: Start accepts. Automaton has 20113 states and 28398 transitions. Word has length 226 [2025-03-03 20:50:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 20113 states and 28398 transitions. [2025-03-03 20:50:51,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2025-03-03 20:50:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20113 states and 28398 transitions. [2025-03-03 20:50:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 20:50:51,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:51,621 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:51,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:50:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:50:51,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:51,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1800109767, now seen corresponding path program 1 times [2025-03-03 20:50:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:51,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205995943] [2025-03-03 20:50:51,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:51,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:50:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:50:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205995943] [2025-03-03 20:50:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205995943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:50:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367485923] [2025-03-03 20:50:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:50:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:51,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:50:51,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:50:51,987 INFO L87 Difference]: Start difference. First operand 20113 states and 28398 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:50:54,330 INFO L93 Difference]: Finished difference Result 50679 states and 71619 transitions. [2025-03-03 20:50:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:50:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227 [2025-03-03 20:50:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:50:54,455 INFO L225 Difference]: With dead ends: 50679 [2025-03-03 20:50:54,455 INFO L226 Difference]: Without dead ends: 30569 [2025-03-03 20:50:54,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:50:54,499 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 312 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:50:54,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 695 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:50:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30569 states. [2025-03-03 20:50:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30569 to 26847. [2025-03-03 20:50:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26847 states, 20094 states have (on average 1.3259679506320294) internal successors, (26644), 20336 states have internal predecessors, (26644), 5506 states have call successors, (5506), 1246 states have call predecessors, (5506), 1246 states have return successors, (5506), 5264 states have call predecessors, (5506), 5506 states have call successors, (5506) [2025-03-03 20:50:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26847 states to 26847 states and 37656 transitions. [2025-03-03 20:50:56,825 INFO L78 Accepts]: Start accepts. Automaton has 26847 states and 37656 transitions. Word has length 227 [2025-03-03 20:50:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:50:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 26847 states and 37656 transitions. [2025-03-03 20:50:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:50:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 26847 states and 37656 transitions. [2025-03-03 20:50:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 20:50:56,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:50:56,829 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:50:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:50:56,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:50:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:50:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1098556127, now seen corresponding path program 1 times [2025-03-03 20:50:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:50:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917300583] [2025-03-03 20:50:56,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:50:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:50:56,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 20:50:56,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 20:50:56,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:50:56,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:50:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:50:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:50:56,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917300583] [2025-03-03 20:50:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917300583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:50:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:50:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:50:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960964131] [2025-03-03 20:50:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:50:56,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:50:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:50:56,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:50:56,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:50:56,929 INFO L87 Difference]: Start difference. First operand 26847 states and 37656 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:01,195 INFO L93 Difference]: Finished difference Result 68938 states and 96807 transitions. [2025-03-03 20:51:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:51:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-03-03 20:51:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:01,367 INFO L225 Difference]: With dead ends: 68938 [2025-03-03 20:51:01,367 INFO L226 Difference]: Without dead ends: 50070 [2025-03-03 20:51:01,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:51:01,419 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 110 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:01,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 379 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:51:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50070 states. [2025-03-03 20:51:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50070 to 50068. [2025-03-03 20:51:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50068 states, 37489 states have (on average 1.3245218597455253) internal successors, (49655), 37953 states have internal predecessors, (49655), 10258 states have call successors, (10258), 2320 states have call predecessors, (10258), 2320 states have return successors, (10258), 9794 states have call predecessors, (10258), 10258 states have call successors, (10258) [2025-03-03 20:51:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50068 states to 50068 states and 70171 transitions. [2025-03-03 20:51:05,886 INFO L78 Accepts]: Start accepts. Automaton has 50068 states and 70171 transitions. Word has length 228 [2025-03-03 20:51:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:05,886 INFO L471 AbstractCegarLoop]: Abstraction has 50068 states and 70171 transitions. [2025-03-03 20:51:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50068 states and 70171 transitions. [2025-03-03 20:51:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 20:51:05,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:05,891 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:51:05,891 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1472672902, now seen corresponding path program 1 times [2025-03-03 20:51:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259008462] [2025-03-03 20:51:05,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:05,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 20:51:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 20:51:05,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259008462] [2025-03-03 20:51:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259008462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:06,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:51:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526376523] [2025-03-03 20:51:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:06,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:51:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:06,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:51:06,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:51:06,069 INFO L87 Difference]: Start difference. First operand 50068 states and 70171 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:12,897 INFO L93 Difference]: Finished difference Result 96411 states and 135266 transitions. [2025-03-03 20:51:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:51:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-03-03 20:51:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:13,143 INFO L225 Difference]: With dead ends: 96411 [2025-03-03 20:51:13,144 INFO L226 Difference]: Without dead ends: 65327 [2025-03-03 20:51:13,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:51:13,220 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 473 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:13,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 574 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:51:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65327 states. [2025-03-03 20:51:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65327 to 62528. [2025-03-03 20:51:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62528 states, 46430 states have (on average 1.3205470600904587) internal successors, (61313), 47044 states have internal predecessors, (61313), 13129 states have call successors, (13129), 2968 states have call predecessors, (13129), 2968 states have return successors, (13129), 12515 states have call predecessors, (13129), 13129 states have call successors, (13129) [2025-03-03 20:51:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62528 states to 62528 states and 87571 transitions. [2025-03-03 20:51:20,145 INFO L78 Accepts]: Start accepts. Automaton has 62528 states and 87571 transitions. Word has length 228 [2025-03-03 20:51:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:20,146 INFO L471 AbstractCegarLoop]: Abstraction has 62528 states and 87571 transitions. [2025-03-03 20:51:20,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62528 states and 87571 transitions. [2025-03-03 20:51:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 20:51:20,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:20,151 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:51:20,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1761634059, now seen corresponding path program 1 times [2025-03-03 20:51:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215392974] [2025-03-03 20:51:20,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:20,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 20:51:20,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 20:51:20,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:20,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215392974] [2025-03-03 20:51:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215392974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:20,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:51:20,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562415806] [2025-03-03 20:51:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:20,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:51:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:20,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:51:20,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:51:20,288 INFO L87 Difference]: Start difference. First operand 62528 states and 87571 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:26,222 INFO L93 Difference]: Finished difference Result 113784 states and 160619 transitions. [2025-03-03 20:51:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:51:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 229 [2025-03-03 20:51:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:26,436 INFO L225 Difference]: With dead ends: 113784 [2025-03-03 20:51:26,436 INFO L226 Difference]: Without dead ends: 75642 [2025-03-03 20:51:26,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:51:26,517 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 468 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:26,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 869 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:51:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75642 states. [2025-03-03 20:51:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75642 to 63860. [2025-03-03 20:51:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63860 states, 47762 states have (on average 1.325426070935053) internal successors, (63305), 48376 states have internal predecessors, (63305), 13129 states have call successors, (13129), 2968 states have call predecessors, (13129), 2968 states have return successors, (13129), 12515 states have call predecessors, (13129), 13129 states have call successors, (13129) [2025-03-03 20:51:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63860 states to 63860 states and 89563 transitions. [2025-03-03 20:51:32,616 INFO L78 Accepts]: Start accepts. Automaton has 63860 states and 89563 transitions. Word has length 229 [2025-03-03 20:51:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:32,616 INFO L471 AbstractCegarLoop]: Abstraction has 63860 states and 89563 transitions. [2025-03-03 20:51:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 63860 states and 89563 transitions. [2025-03-03 20:51:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 20:51:32,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:32,621 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:51:32,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1045081326, now seen corresponding path program 1 times [2025-03-03 20:51:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073784557] [2025-03-03 20:51:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:32,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 20:51:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 20:51:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:32,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073784557] [2025-03-03 20:51:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073784557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:51:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299427363] [2025-03-03 20:51:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:51:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:51:32,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:51:32,756 INFO L87 Difference]: Start difference. First operand 63860 states and 89563 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)