./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.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-ps-ci_file-34.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 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:37:35,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:37:35,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:37:35,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:37:35,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:37:35,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:37:35,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:37:35,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:37:35,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:37:35,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:37:35,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:37:35,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:37:35,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:37:35,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:37:35,968 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:37:35,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:37:35,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:37:35,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:35,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:37:35,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:37:35,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:37:35,971 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 -> 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 [2025-03-03 21:37:36,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:37:36,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:37:36,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:37:36,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:37:36,193 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:37:36,195 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-ps-ci_file-34.i [2025-03-03 21:37:37,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f61cd3a7/a367e2cbd96044119f7cfe62cffe9e8f/FLAGcbf890d4b [2025-03-03 21:37:37,613 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:37:37,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-03-03 21:37:37,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f61cd3a7/a367e2cbd96044119f7cfe62cffe9e8f/FLAGcbf890d4b [2025-03-03 21:37:37,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f61cd3a7/a367e2cbd96044119f7cfe62cffe9e8f [2025-03-03 21:37:37,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:37:37,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:37:37,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:37,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:37:37,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:37:37,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37, skipping insertion in model container [2025-03-03 21:37:37,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:37:37,758 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-ps-ci_file-34.i[919,932] [2025-03-03 21:37:37,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:37,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:37:37,848 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-ps-ci_file-34.i[919,932] [2025-03-03 21:37:37,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:37:37,903 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:37:37,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37 WrapperNode [2025-03-03 21:37:37,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:37:37,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:37,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:37:37,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:37:37,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,959 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-03 21:37:37,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:37:37,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:37:37,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:37:37,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:37:37,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,992 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 21:37:37,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:37,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:38,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:38,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:38,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:37:38,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:37:38,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:37:38,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:37:38,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (1/1) ... [2025-03-03 21:37:38,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:37:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:38,032 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 21:37:38,035 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 21:37:38,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:37:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:37:38,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:37:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:37:38,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:37:38,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:37:38,123 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:37:38,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:37:38,395 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-03 21:37:38,423 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 21:37:38,423 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:37:38,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:37:38,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:37:38,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:38 BoogieIcfgContainer [2025-03-03 21:37:38,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:37:38,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:37:38,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:37:38,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:37:38,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:37:37" (1/3) ... [2025-03-03 21:37:38,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695ca97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:38, skipping insertion in model container [2025-03-03 21:37:38,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:37" (2/3) ... [2025-03-03 21:37:38,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695ca97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:38, skipping insertion in model container [2025-03-03 21:37:38,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:38" (3/3) ... [2025-03-03 21:37:38,450 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-03-03 21:37:38,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:37:38,461 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:37:38,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:37:38,519 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;@41f1ddc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:37:38,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:37:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:37:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:37:38,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:38,537 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:38,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -866593294, now seen corresponding path program 1 times [2025-03-03 21:37:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753268700] [2025-03-03 21:37:38,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:37:38,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:37:38,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:38,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:37:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753268700] [2025-03-03 21:37:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753268700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:37:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529540832] [2025-03-03 21:37:38,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:38,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:37:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:37:38,781 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 21:37:38,782 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 21:37:38,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:37:38,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:37:38,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:38,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:37:38,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:37:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 21:37:38,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:37:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529540832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:37:38,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:37:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455372823] [2025-03-03 21:37:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:38,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:37:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:37:39,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:37:39,007 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:37:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:39,039 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-03-03 21:37:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:37:39,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-03-03 21:37:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:39,047 INFO L225 Difference]: With dead ends: 178 [2025-03-03 21:37:39,047 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 21:37:39,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:37:39,053 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:39,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:37:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 21:37:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 21:37:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 21:37:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-03-03 21:37:39,095 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 141 [2025-03-03 21:37:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-03-03 21:37:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:37:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-03-03 21:37:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:37:39,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:39,098 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:39,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:37:39,303 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 21:37:39,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:39,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash 509729172, now seen corresponding path program 1 times [2025-03-03 21:37:39,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735569977] [2025-03-03 21:37:39,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:37:39,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:37:39,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:39,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:37:39,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735569977] [2025-03-03 21:37:39,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735569977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:39,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:39,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:37:39,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124012697] [2025-03-03 21:37:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:39,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:37:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:39,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:37:39,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:37:39,711 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:39,874 INFO L93 Difference]: Finished difference Result 291 states and 456 transitions. [2025-03-03 21:37:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:37:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-03 21:37:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:39,877 INFO L225 Difference]: With dead ends: 291 [2025-03-03 21:37:39,878 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 21:37:39,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:37:39,880 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 165 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:39,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 421 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:37:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 21:37:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 175. [2025-03-03 21:37:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:37:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-03-03 21:37:39,912 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 141 [2025-03-03 21:37:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:39,912 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-03-03 21:37:39,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-03-03 21:37:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 21:37:39,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:39,914 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:39,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:37:39,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2059868363, now seen corresponding path program 1 times [2025-03-03 21:37:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17621842] [2025-03-03 21:37:39,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:39,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 21:37:39,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 21:37:39,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:39,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:37:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17621842] [2025-03-03 21:37:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17621842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:40,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:37:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433254058] [2025-03-03 21:37:40,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:40,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:37:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:40,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:37:40,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:37:40,135 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:40,386 INFO L93 Difference]: Finished difference Result 514 states and 808 transitions. [2025-03-03 21:37:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:37:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-03 21:37:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:40,390 INFO L225 Difference]: With dead ends: 514 [2025-03-03 21:37:40,392 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 21:37:40,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:37:40,394 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 177 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:40,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 520 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:37:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 21:37:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 179. [2025-03-03 21:37:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 21:37:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2025-03-03 21:37:40,439 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 142 [2025-03-03 21:37:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:40,439 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2025-03-03 21:37:40,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2025-03-03 21:37:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:37:40,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:40,442 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:37:40,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -506455536, now seen corresponding path program 1 times [2025-03-03 21:37:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538563460] [2025-03-03 21:37:40,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:37:40,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:37:40,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:40,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:37:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538563460] [2025-03-03 21:37:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538563460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:37:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968171110] [2025-03-03 21:37:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:37:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:40,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:37:40,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:37:40,942 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:41,187 INFO L93 Difference]: Finished difference Result 474 states and 737 transitions. [2025-03-03 21:37:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:37:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:37:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:41,190 INFO L225 Difference]: With dead ends: 474 [2025-03-03 21:37:41,190 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 21:37:41,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:37:41,192 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:41,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 334 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:37:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 21:37:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2025-03-03 21:37:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:37:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 378 transitions. [2025-03-03 21:37:41,244 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 378 transitions. Word has length 143 [2025-03-03 21:37:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:41,244 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 378 transitions. [2025-03-03 21:37:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 378 transitions. [2025-03-03 21:37:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:37:41,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:41,246 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:37:41,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:41,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash -896911, now seen corresponding path program 1 times [2025-03-03 21:37:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:41,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340897279] [2025-03-03 21:37:41,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:41,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:37:41,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:37:41,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:41,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:37:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:37:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:37:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340897279] [2025-03-03 21:37:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340897279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:37:42,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:37:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:37:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874777453] [2025-03-03 21:37:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:37:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:37:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:37:42,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:37:42,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:37:42,660 INFO L87 Difference]: Start difference. First operand 242 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:37:43,031 INFO L93 Difference]: Finished difference Result 482 states and 747 transitions. [2025-03-03 21:37:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:37:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:37:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:37:43,033 INFO L225 Difference]: With dead ends: 482 [2025-03-03 21:37:43,033 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 21:37:43,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:37:43,038 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 186 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:37:43,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 448 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:37:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 21:37:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2025-03-03 21:37:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 184 states have (on average 1.4456521739130435) internal successors, (266), 184 states have internal predecessors, (266), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:37:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 386 transitions. [2025-03-03 21:37:43,068 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 386 transitions. Word has length 143 [2025-03-03 21:37:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:37:43,069 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 386 transitions. [2025-03-03 21:37:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:37:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 386 transitions. [2025-03-03 21:37:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:37:43,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:37:43,071 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:37:43,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:37:43,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:37:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:37:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1550471604, now seen corresponding path program 1 times [2025-03-03 21:37:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:37:43,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169979933] [2025-03-03 21:37:43,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:37:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:37:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:37:43,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:37:43,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:37:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169979933] [2025-03-03 21:38:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169979933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:08,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:08,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:38:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321059753] [2025-03-03 21:38:08,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:08,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:38:08,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:08,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:38:08,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:38:08,748 INFO L87 Difference]: Start difference. First operand 248 states and 386 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:38:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:13,309 INFO L93 Difference]: Finished difference Result 677 states and 1020 transitions. [2025-03-03 21:38:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:38:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-03-03 21:38:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:13,313 INFO L225 Difference]: With dead ends: 677 [2025-03-03 21:38:13,313 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 21:38:13,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:38:13,314 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 595 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:13,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1047 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 21:38:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 21:38:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 333. [2025-03-03 21:38:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:38:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 510 transitions. [2025-03-03 21:38:13,344 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 510 transitions. Word has length 143 [2025-03-03 21:38:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:13,344 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 510 transitions. [2025-03-03 21:38:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:38:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 510 transitions. [2025-03-03 21:38:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:38:13,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:13,347 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:13,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:38:13,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -662967923, now seen corresponding path program 1 times [2025-03-03 21:38:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382611045] [2025-03-03 21:38:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:13,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:38:13,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:38:13,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:13,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382611045] [2025-03-03 21:38:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382611045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:38:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530311959] [2025-03-03 21:38:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:15,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:38:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:15,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:38:15,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:38:15,041 INFO L87 Difference]: Start difference. First operand 333 states and 510 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:15,817 INFO L93 Difference]: Finished difference Result 746 states and 1127 transitions. [2025-03-03 21:38:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:38:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:38:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:15,820 INFO L225 Difference]: With dead ends: 746 [2025-03-03 21:38:15,820 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 21:38:15,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:38:15,821 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 368 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:15,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 506 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:38:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 21:38:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 412. [2025-03-03 21:38:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 348 states have (on average 1.4252873563218391) internal successors, (496), 348 states have internal predecessors, (496), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:38:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 616 transitions. [2025-03-03 21:38:15,848 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 616 transitions. Word has length 143 [2025-03-03 21:38:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:15,848 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 616 transitions. [2025-03-03 21:38:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 616 transitions. [2025-03-03 21:38:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:38:15,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:15,849 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:38:15,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 937041229, now seen corresponding path program 1 times [2025-03-03 21:38:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685678519] [2025-03-03 21:38:15,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:38:15,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:38:15,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:15,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685678519] [2025-03-03 21:38:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685678519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 21:38:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035118283] [2025-03-03 21:38:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:38:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:38:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:38:16,968 INFO L87 Difference]: Start difference. First operand 412 states and 616 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:38:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:17,751 INFO L93 Difference]: Finished difference Result 766 states and 1137 transitions. [2025-03-03 21:38:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:38:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-03-03 21:38:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:17,754 INFO L225 Difference]: With dead ends: 766 [2025-03-03 21:38:17,754 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 21:38:17,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:38:17,755 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 410 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:17,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 632 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:38:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 21:38:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 422. [2025-03-03 21:38:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 358 states have (on average 1.4273743016759777) internal successors, (511), 358 states have internal predecessors, (511), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:38:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 631 transitions. [2025-03-03 21:38:17,782 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 631 transitions. Word has length 143 [2025-03-03 21:38:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:17,782 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 631 transitions. [2025-03-03 21:38:17,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 21:38:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 631 transitions. [2025-03-03 21:38:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 21:38:17,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:17,784 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:38:17,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2061005781, now seen corresponding path program 1 times [2025-03-03 21:38:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:17,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295427023] [2025-03-03 21:38:17,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:17,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 21:38:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 21:38:17,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:17,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:24,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295427023] [2025-03-03 21:38:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295427023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:38:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430329359] [2025-03-03 21:38:24,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:24,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:38:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:24,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:38:24,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:38:24,217 INFO L87 Difference]: Start difference. First operand 422 states and 631 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:27,079 INFO L93 Difference]: Finished difference Result 768 states and 1136 transitions. [2025-03-03 21:38:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:38:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 21:38:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:27,083 INFO L225 Difference]: With dead ends: 768 [2025-03-03 21:38:27,083 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 21:38:27,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:38:27,084 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 321 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:27,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1007 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:38:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 21:38:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 447. [2025-03-03 21:38:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 383 states have (on average 1.4360313315926894) internal successors, (550), 383 states have internal predecessors, (550), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:38:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 670 transitions. [2025-03-03 21:38:27,110 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 670 transitions. Word has length 143 [2025-03-03 21:38:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:27,110 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 670 transitions. [2025-03-03 21:38:27,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 670 transitions. [2025-03-03 21:38:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:38:27,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:27,112 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:27,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:38:27,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -408568730, now seen corresponding path program 1 times [2025-03-03 21:38:27,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:27,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100500260] [2025-03-03 21:38:27,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:27,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:27,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:38:27,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:38:27,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100500260] [2025-03-03 21:38:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100500260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:38:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650483240] [2025-03-03 21:38:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:39,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:38:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:39,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:38:39,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:38:39,289 INFO L87 Difference]: Start difference. First operand 447 states and 670 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:39,756 INFO L93 Difference]: Finished difference Result 946 states and 1401 transitions. [2025-03-03 21:38:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:38:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 21:38:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:39,760 INFO L225 Difference]: With dead ends: 946 [2025-03-03 21:38:39,760 INFO L226 Difference]: Without dead ends: 770 [2025-03-03 21:38:39,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:38:39,762 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 224 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:39,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 925 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:38:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-03 21:38:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 604. [2025-03-03 21:38:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 533 states have (on average 1.4165103189493433) internal successors, (755), 534 states have internal predecessors, (755), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 21:38:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 885 transitions. [2025-03-03 21:38:39,795 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 885 transitions. Word has length 144 [2025-03-03 21:38:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 885 transitions. [2025-03-03 21:38:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 885 transitions. [2025-03-03 21:38:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:38:39,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:39,798 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:39,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:38:39,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 944740967, now seen corresponding path program 1 times [2025-03-03 21:38:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922141613] [2025-03-03 21:38:39,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:39,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:38:39,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:38:39,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922141613] [2025-03-03 21:38:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922141613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:40,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 21:38:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758547207] [2025-03-03 21:38:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:40,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:38:40,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:40,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:38:40,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:38:40,625 INFO L87 Difference]: Start difference. First operand 604 states and 885 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:41,190 INFO L93 Difference]: Finished difference Result 913 states and 1346 transitions. [2025-03-03 21:38:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:38:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 21:38:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:41,193 INFO L225 Difference]: With dead ends: 913 [2025-03-03 21:38:41,193 INFO L226 Difference]: Without dead ends: 775 [2025-03-03 21:38:41,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:38:41,198 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 332 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:41,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1108 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:38:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-03 21:38:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 674. [2025-03-03 21:38:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 587 states have (on average 1.41396933560477) internal successors, (830), 587 states have internal predecessors, (830), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 21:38:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 990 transitions. [2025-03-03 21:38:41,225 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 990 transitions. Word has length 144 [2025-03-03 21:38:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 990 transitions. [2025-03-03 21:38:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 990 transitions. [2025-03-03 21:38:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:38:41,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:41,227 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:41,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:38:41,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:41,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 60685056, now seen corresponding path program 1 times [2025-03-03 21:38:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:41,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751139815] [2025-03-03 21:38:41,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:41,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:38:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:38:41,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:41,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:43,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:43,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751139815] [2025-03-03 21:38:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751139815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:43,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:38:43,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891877629] [2025-03-03 21:38:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:43,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:38:43,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:43,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:38:43,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:38:43,593 INFO L87 Difference]: Start difference. First operand 674 states and 990 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:38:45,969 INFO L93 Difference]: Finished difference Result 1513 states and 2227 transitions. [2025-03-03 21:38:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:38:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 21:38:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:38:45,972 INFO L225 Difference]: With dead ends: 1513 [2025-03-03 21:38:45,973 INFO L226 Difference]: Without dead ends: 1113 [2025-03-03 21:38:45,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:38:45,974 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 363 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:38:45,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 628 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:38:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-03 21:38:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 805. [2025-03-03 21:38:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 718 states have (on average 1.4220055710306407) internal successors, (1021), 718 states have internal predecessors, (1021), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 21:38:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1181 transitions. [2025-03-03 21:38:46,003 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1181 transitions. Word has length 144 [2025-03-03 21:38:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:38:46,004 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1181 transitions. [2025-03-03 21:38:46,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:38:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1181 transitions. [2025-03-03 21:38:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:38:46,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:38:46,005 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:38:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:38:46,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:38:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:38:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1746769407, now seen corresponding path program 1 times [2025-03-03 21:38:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:38:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051627899] [2025-03-03 21:38:46,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:38:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:38:46,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:38:46,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:38:46,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:38:46,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:38:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 21:38:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:38:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051627899] [2025-03-03 21:38:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051627899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:38:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:38:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:38:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034660974] [2025-03-03 21:38:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:38:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:38:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:38:58,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:38:58,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:38:58,921 INFO L87 Difference]: Start difference. First operand 805 states and 1181 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:39:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:39:00,556 INFO L93 Difference]: Finished difference Result 1413 states and 2060 transitions. [2025-03-03 21:39:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:39:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 21:39:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:39:00,560 INFO L225 Difference]: With dead ends: 1413 [2025-03-03 21:39:00,560 INFO L226 Difference]: Without dead ends: 1001 [2025-03-03 21:39:00,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:39:00,561 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 304 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:39:00,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1073 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:39:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-03 21:39:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 797. [2025-03-03 21:39:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 710 states have (on average 1.423943661971831) internal successors, (1011), 710 states have internal predecessors, (1011), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 21:39:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1171 transitions. [2025-03-03 21:39:00,590 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1171 transitions. Word has length 144 [2025-03-03 21:39:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:39:00,590 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1171 transitions. [2025-03-03 21:39:00,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 21:39:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1171 transitions. [2025-03-03 21:39:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 21:39:00,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:39:00,591 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:39:00,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:39:00,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:39:00,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:39:00,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2037663712, now seen corresponding path program 1 times [2025-03-03 21:39:00,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:39:00,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580892465] [2025-03-03 21:39:00,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:39:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:39:00,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 21:39:00,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 21:39:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:39:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat