./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_loopvsstraightlinecode_100-1loop_file-63.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 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:00:43,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:00:43,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:00:43,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:00:43,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:00:43,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:00:43,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:00:43,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:00:43,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:00:43,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:00:43,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:00:43,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:00:43,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:00:43,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:00:43,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:00:43,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:00:43,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:00:43,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:00:43,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:43,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:00:43,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:00:43,893 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 -> 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d [2025-03-08 14:00:44,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:00:44,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:00:44,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:00:44,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:00:44,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:00:44,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-08 14:00:45,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced336bff/021fb4fc316b417da0566dc8048b57ed/FLAG8dfbb26ed [2025-03-08 14:00:45,641 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:00:45,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-08 14:00:45,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced336bff/021fb4fc316b417da0566dc8048b57ed/FLAG8dfbb26ed [2025-03-08 14:00:45,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced336bff/021fb4fc316b417da0566dc8048b57ed [2025-03-08 14:00:45,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:00:45,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:00:45,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:45,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:00:45,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:00:45,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:45,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c928ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45, skipping insertion in model container [2025-03-08 14:00:45,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:45,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:00:45,824 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2025-03-08 14:00:45,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:45,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:00:45,909 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2025-03-08 14:00:45,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:45,967 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:00:45,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45 WrapperNode [2025-03-08 14:00:45,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:45,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:45,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:00:45,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:00:45,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:45,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,042 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2025-03-08 14:00:46,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:46,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:00:46,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:00:46,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:00:46,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,082 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-08 14:00:46,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:00:46,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:00:46,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:00:46,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:00:46,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (1/1) ... [2025-03-08 14:00:46,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:46,147 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-08 14:00:46,149 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-08 14:00:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:00:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:00:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:00:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:00:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:00:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:00:46,241 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:00:46,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:00:46,598 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~short19#1; [2025-03-08 14:00:46,625 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 14:00:46,626 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:00:46,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:00:46,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:00:46,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:00:46 BoogieIcfgContainer [2025-03-08 14:00:46,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:00:46,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:00:46,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:00:46,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:00:46,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:00:45" (1/3) ... [2025-03-08 14:00:46,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757e1e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:00:46, skipping insertion in model container [2025-03-08 14:00:46,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:45" (2/3) ... [2025-03-08 14:00:46,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757e1e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:00:46, skipping insertion in model container [2025-03-08 14:00:46,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:00:46" (3/3) ... [2025-03-08 14:00:46,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-08 14:00:46,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:00:46,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:00:46,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:00:46,751 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;@1eb0ed29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:00:46,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:00:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 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-08 14:00:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:00:46,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:46,763 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:46,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1773125691, now seen corresponding path program 1 times [2025-03-08 14:00:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591591449] [2025-03-08 14:00:46,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:46,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:47,031 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-08 14:00:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591591449] [2025-03-08 14:00:47,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591591449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:00:47,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176779497] [2025-03-08 14:00:47,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:47,037 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-08 14:00:47,039 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-08 14:00:47,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:47,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:47,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:47,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:00:47,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:00:47,204 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-08 14:00:47,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:00:47,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176779497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:47,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:00:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:00:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880091707] [2025-03-08 14:00:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:47,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:00:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:47,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:00:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:00:47,230 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-08 14:00:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:47,249 INFO L93 Difference]: Finished difference Result 171 states and 287 transitions. [2025-03-08 14:00:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:00:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 143 [2025-03-08 14:00:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:47,257 INFO L225 Difference]: With dead ends: 171 [2025-03-08 14:00:47,258 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 14:00:47,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-08 14:00:47,264 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:47,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:00:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 14:00:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 14:00:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 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-08 14:00:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-08 14:00:47,298 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 143 [2025-03-08 14:00:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:47,299 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-08 14:00:47,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-08 14:00:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-08 14:00:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:00:47,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:47,302 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:47,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:00:47,503 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-08 14:00:47,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -522257251, now seen corresponding path program 1 times [2025-03-08 14:00:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729726370] [2025-03-08 14:00:47,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:47,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:48,147 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-08 14:00:48,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729726370] [2025-03-08 14:00:48,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729726370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:48,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:00:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291783129] [2025-03-08 14:00:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:48,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:00:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:48,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:00:48,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:00:48,149 INFO L87 Difference]: Start difference. First operand 83 states and 125 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-08 14:00:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:48,317 INFO L93 Difference]: Finished difference Result 244 states and 370 transitions. [2025-03-08 14:00:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:00:48,318 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-08 14:00:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:48,320 INFO L225 Difference]: With dead ends: 244 [2025-03-08 14:00:48,320 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 14:00:48,321 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-08 14:00:48,322 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:00:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 14:00:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2025-03-08 14:00:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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-08 14:00:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2025-03-08 14:00:48,353 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 143 [2025-03-08 14:00:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2025-03-08 14:00:48,355 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-08 14:00:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2025-03-08 14:00:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:00:48,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:48,357 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-08 14:00:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:00:48,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -589264004, now seen corresponding path program 1 times [2025-03-08 14:00:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584895259] [2025-03-08 14:00:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:48,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:48,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:48,800 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-08 14:00:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584895259] [2025-03-08 14:00:48,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584895259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:48,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:48,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:00:48,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159030198] [2025-03-08 14:00:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:48,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:00:48,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:48,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:00:48,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:00:48,804 INFO L87 Difference]: Start difference. First operand 129 states and 196 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-08 14:00:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:48,943 INFO L93 Difference]: Finished difference Result 310 states and 464 transitions. [2025-03-08 14:00:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:00:48,944 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-08 14:00:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:48,948 INFO L225 Difference]: With dead ends: 310 [2025-03-08 14:00:48,948 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 14:00:48,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:00:48,951 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:48,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 355 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:00:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 14:00:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2025-03-08 14:00:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 131 states have internal predecessors, (178), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:00:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 274 transitions. [2025-03-08 14:00:48,986 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 274 transitions. Word has length 143 [2025-03-08 14:00:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:48,987 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 274 transitions. [2025-03-08 14:00:48,987 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-08 14:00:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2025-03-08 14:00:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:00:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:48,992 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-08 14:00:48,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:00:48,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 458262490, now seen corresponding path program 1 times [2025-03-08 14:00:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385482081] [2025-03-08 14:00:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:49,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:49,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:49,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:49,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:53,789 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-08 14:00:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:53,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385482081] [2025-03-08 14:00:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385482081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 14:00:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399444934] [2025-03-08 14:00:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:53,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:00:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:53,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:00:53,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:00:53,791 INFO L87 Difference]: Start difference. First operand 182 states and 274 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:00:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:55,342 INFO L93 Difference]: Finished difference Result 704 states and 1028 transitions. [2025-03-08 14:00:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 14:00:55,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:00:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:55,346 INFO L225 Difference]: With dead ends: 704 [2025-03-08 14:00:55,346 INFO L226 Difference]: Without dead ends: 572 [2025-03-08 14:00:55,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2025-03-08 14:00:55,348 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 540 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:55,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 588 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:00:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-08 14:00:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 218. [2025-03-08 14:00:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.3975903614457832) internal successors, (232), 167 states have internal predecessors, (232), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:00:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 328 transitions. [2025-03-08 14:00:55,377 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 328 transitions. Word has length 143 [2025-03-08 14:00:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:55,377 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 328 transitions. [2025-03-08 14:00:55,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:00:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 328 transitions. [2025-03-08 14:00:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:00:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:55,379 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-08 14:00:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:00:55,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2093894471, now seen corresponding path program 1 times [2025-03-08 14:00:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906061551] [2025-03-08 14:00:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:00:55,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:00:55,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:55,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:59,082 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-08 14:00:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906061551] [2025-03-08 14:00:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906061551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 14:00:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547366722] [2025-03-08 14:00:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:00:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:59,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:00:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:00:59,085 INFO L87 Difference]: Start difference. First operand 218 states and 328 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:01:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:00,370 INFO L93 Difference]: Finished difference Result 767 states and 1141 transitions. [2025-03-08 14:01:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:01:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:01:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:00,373 INFO L225 Difference]: With dead ends: 767 [2025-03-08 14:01:00,373 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 14:01:00,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:01:00,374 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 615 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:00,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 666 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:01:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 14:01:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 288. [2025-03-08 14:01:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 236 states have (on average 1.4406779661016949) internal successors, (340), 237 states have internal predecessors, (340), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 436 transitions. [2025-03-08 14:01:00,397 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 436 transitions. Word has length 143 [2025-03-08 14:01:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:00,398 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 436 transitions. [2025-03-08 14:01:00,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-08 14:01:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 436 transitions. [2025-03-08 14:01:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:01:00,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:00,399 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-08 14:01:00,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:01:00,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:00,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash -377913091, now seen corresponding path program 1 times [2025-03-08 14:01:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853242318] [2025-03-08 14:01:00,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:01:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:01:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:00,585 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-08 14:01:00,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:00,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853242318] [2025-03-08 14:01:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853242318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:01:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875939723] [2025-03-08 14:01:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:01:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:00,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:01:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:01:00,587 INFO L87 Difference]: Start difference. First operand 288 states and 436 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-08 14:01:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:00,760 INFO L93 Difference]: Finished difference Result 706 states and 1062 transitions. [2025-03-08 14:01:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:01:00,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-08 14:01:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:00,763 INFO L225 Difference]: With dead ends: 706 [2025-03-08 14:01:00,763 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 14:01:00,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:01:00,764 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 173 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:00,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 503 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:01:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 14:01:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 311. [2025-03-08 14:01:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 258 states have (on average 1.437984496124031) internal successors, (371), 259 states have internal predecessors, (371), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 467 transitions. [2025-03-08 14:01:00,781 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 467 transitions. Word has length 143 [2025-03-08 14:01:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:00,782 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 467 transitions. [2025-03-08 14:01:00,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-08 14:01:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 467 transitions. [2025-03-08 14:01:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:01:00,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:00,783 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-08 14:01:00,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:01:00,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:00,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1364897244, now seen corresponding path program 1 times [2025-03-08 14:01:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315142162] [2025-03-08 14:01:00,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:01:00,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:01:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:05,003 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-08 14:01:05,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:05,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315142162] [2025-03-08 14:01:05,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315142162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:05,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:05,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 14:01:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616327614] [2025-03-08 14:01:05,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:05,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:01:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:05,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:01:05,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:01:05,005 INFO L87 Difference]: Start difference. First operand 311 states and 467 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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-08 14:01:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:06,075 INFO L93 Difference]: Finished difference Result 762 states and 1138 transitions. [2025-03-08 14:01:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 14:01:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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-08 14:01:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:06,079 INFO L225 Difference]: With dead ends: 762 [2025-03-08 14:01:06,079 INFO L226 Difference]: Without dead ends: 540 [2025-03-08 14:01:06,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-03-08 14:01:06,080 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 403 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 666 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:01:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-08 14:01:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 331. [2025-03-08 14:01:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 279 states have internal predecessors, (400), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 496 transitions. [2025-03-08 14:01:06,103 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 496 transitions. Word has length 143 [2025-03-08 14:01:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:06,103 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 496 transitions. [2025-03-08 14:01:06,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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-08 14:01:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 496 transitions. [2025-03-08 14:01:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:01:06,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:06,104 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-08 14:01:06,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:01:06,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 669613403, now seen corresponding path program 1 times [2025-03-08 14:01:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079321525] [2025-03-08 14:01:06,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:06,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:01:06,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:01:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:06,229 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-08 14:01:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079321525] [2025-03-08 14:01:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079321525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:06,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:06,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:01:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009020592] [2025-03-08 14:01:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:06,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:01:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:06,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:01:06,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:01:06,231 INFO L87 Difference]: Start difference. First operand 331 states and 496 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-08 14:01:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:06,325 INFO L93 Difference]: Finished difference Result 648 states and 962 transitions. [2025-03-08 14:01:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:01:06,326 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-08 14:01:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:06,327 INFO L225 Difference]: With dead ends: 648 [2025-03-08 14:01:06,327 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 14:01:06,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:01:06,328 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 138 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 353 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:01:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 14:01:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 312. [2025-03-08 14:01:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 259 states have (on average 1.4247104247104247) internal successors, (369), 260 states have internal predecessors, (369), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 465 transitions. [2025-03-08 14:01:06,349 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 465 transitions. Word has length 143 [2025-03-08 14:01:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 465 transitions. [2025-03-08 14:01:06,350 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-08 14:01:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 465 transitions. [2025-03-08 14:01:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:01:06,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:06,355 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-08 14:01:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 14:01:06,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -549506371, now seen corresponding path program 1 times [2025-03-08 14:01:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029711905] [2025-03-08 14:01:06,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:06,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:01:06,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:01:06,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:06,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:06,393 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-08 14:01:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029711905] [2025-03-08 14:01:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029711905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:06,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:01:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484780949] [2025-03-08 14:01:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:06,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:01:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:06,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:01:06,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:01:06,395 INFO L87 Difference]: Start difference. First operand 312 states and 465 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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-08 14:01:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:06,412 INFO L93 Difference]: Finished difference Result 553 states and 829 transitions. [2025-03-08 14:01:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:01:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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-08 14:01:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:06,415 INFO L225 Difference]: With dead ends: 553 [2025-03-08 14:01:06,415 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 14:01:06,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:01:06,417 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:06,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:01:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 14:01:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-08 14:01:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 261 states have (on average 1.421455938697318) internal successors, (371), 262 states have internal predecessors, (371), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 467 transitions. [2025-03-08 14:01:06,436 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 467 transitions. Word has length 143 [2025-03-08 14:01:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:06,438 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 467 transitions. [2025-03-08 14:01:06,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 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-08 14:01:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 467 transitions. [2025-03-08 14:01:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:06,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:06,439 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-08 14:01:06,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:01:06,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:06,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash 505731383, now seen corresponding path program 1 times [2025-03-08 14:01:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:06,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058387375] [2025-03-08 14:01:06,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:06,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:06,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:10,010 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-08 14:01:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058387375] [2025-03-08 14:01:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058387375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 14:01:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698903907] [2025-03-08 14:01:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 14:01:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 14:01:10,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:01:10,011 INFO L87 Difference]: Start difference. First operand 314 states and 467 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:01:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:11,625 INFO L93 Difference]: Finished difference Result 1130 states and 1659 transitions. [2025-03-08 14:01:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 14:01:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-08 14:01:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:11,629 INFO L225 Difference]: With dead ends: 1130 [2025-03-08 14:01:11,630 INFO L226 Difference]: Without dead ends: 913 [2025-03-08 14:01:11,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:01:11,631 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1097 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 534 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:01:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-08 14:01:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 336. [2025-03-08 14:01:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 283 states have (on average 1.4275618374558303) internal successors, (404), 284 states have internal predecessors, (404), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 14:01:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 500 transitions. [2025-03-08 14:01:11,654 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 500 transitions. Word has length 144 [2025-03-08 14:01:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:11,655 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 500 transitions. [2025-03-08 14:01:11,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:01:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 500 transitions. [2025-03-08 14:01:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:11,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:11,656 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-08 14:01:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 14:01:11,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1715546815, now seen corresponding path program 1 times [2025-03-08 14:01:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437224263] [2025-03-08 14:01:11,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:11,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:11,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:11,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:11,754 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-08 14:01:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437224263] [2025-03-08 14:01:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437224263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:01:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168711568] [2025-03-08 14:01:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:11,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:01:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:11,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:01:11,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:01:11,757 INFO L87 Difference]: Start difference. First operand 336 states and 500 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-08 14:01:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:11,798 INFO L93 Difference]: Finished difference Result 734 states and 1088 transitions. [2025-03-08 14:01:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:01:11,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-08 14:01:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:11,801 INFO L225 Difference]: With dead ends: 734 [2025-03-08 14:01:11,801 INFO L226 Difference]: Without dead ends: 493 [2025-03-08 14:01:11,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:01:11,802 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:11,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 338 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:01:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-08 14:01:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 489. [2025-03-08 14:01:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 421 states have (on average 1.4038004750593824) internal successors, (591), 424 states have internal predecessors, (591), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:01:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 711 transitions. [2025-03-08 14:01:11,824 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 711 transitions. Word has length 144 [2025-03-08 14:01:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:11,824 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 711 transitions. [2025-03-08 14:01:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-08 14:01:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 711 transitions. [2025-03-08 14:01:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:11,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:11,825 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-08 14:01:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 14:01:11,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -338740488, now seen corresponding path program 1 times [2025-03-08 14:01:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328280096] [2025-03-08 14:01:11,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:11,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:11,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:11,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:11,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:14,279 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-08 14:01:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328280096] [2025-03-08 14:01:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328280096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:14,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 14:01:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524075194] [2025-03-08 14:01:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 14:01:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:14,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 14:01:14,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:01:14,280 INFO L87 Difference]: Start difference. First operand 489 states and 711 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-08 14:01:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:15,046 INFO L93 Difference]: Finished difference Result 1427 states and 2072 transitions. [2025-03-08 14:01:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:01:15,047 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-08 14:01:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:15,051 INFO L225 Difference]: With dead ends: 1427 [2025-03-08 14:01:15,051 INFO L226 Difference]: Without dead ends: 1058 [2025-03-08 14:01:15,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-03-08 14:01:15,053 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 573 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:15,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 698 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:01:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-08 14:01:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 486. [2025-03-08 14:01:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 418 states have (on average 1.4066985645933014) internal successors, (588), 421 states have internal predecessors, (588), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:01:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 708 transitions. [2025-03-08 14:01:15,081 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 708 transitions. Word has length 144 [2025-03-08 14:01:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 708 transitions. [2025-03-08 14:01:15,082 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-08 14:01:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 708 transitions. [2025-03-08 14:01:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:15,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:15,084 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-08 14:01:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 14:01:15,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -997892993, now seen corresponding path program 1 times [2025-03-08 14:01:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9171383] [2025-03-08 14:01:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:15,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:15,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:15,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:15,687 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-08 14:01:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9171383] [2025-03-08 14:01:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9171383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:01:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378044818] [2025-03-08 14:01:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:15,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:01:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:15,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:01:15,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:01:15,690 INFO L87 Difference]: Start difference. First operand 486 states and 708 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-08 14:01:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:16,570 INFO L93 Difference]: Finished difference Result 1545 states and 2221 transitions. [2025-03-08 14:01:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 14:01:16,570 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-08 14:01:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:16,574 INFO L225 Difference]: With dead ends: 1545 [2025-03-08 14:01:16,574 INFO L226 Difference]: Without dead ends: 1135 [2025-03-08 14:01:16,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-08 14:01:16,575 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 439 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:16,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 949 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:01:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-08 14:01:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 889. [2025-03-08 14:01:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 809 states have (on average 1.431396786155748) internal successors, (1158), 816 states have internal predecessors, (1158), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 14:01:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1294 transitions. [2025-03-08 14:01:16,615 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1294 transitions. Word has length 144 [2025-03-08 14:01:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1294 transitions. [2025-03-08 14:01:16,616 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-08 14:01:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1294 transitions. [2025-03-08 14:01:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:16,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:16,617 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-08 14:01:16,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 14:01:16,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:16,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1765614881, now seen corresponding path program 1 times [2025-03-08 14:01:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372707363] [2025-03-08 14:01:16,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:16,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:16,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:16,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:16,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:16,819 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-08 14:01:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:16,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372707363] [2025-03-08 14:01:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372707363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:16,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:16,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:01:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429181276] [2025-03-08 14:01:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:01:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:01:16,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:01:16,822 INFO L87 Difference]: Start difference. First operand 889 states and 1294 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 14:01:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:16,990 INFO L93 Difference]: Finished difference Result 1802 states and 2624 transitions. [2025-03-08 14:01:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:01:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 14:01:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:16,996 INFO L225 Difference]: With dead ends: 1802 [2025-03-08 14:01:16,996 INFO L226 Difference]: Without dead ends: 1389 [2025-03-08 14:01:16,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:01:16,998 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 214 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:16,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 477 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:01:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-03-08 14:01:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 939. [2025-03-08 14:01:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 859 states have (on average 1.430733410942957) internal successors, (1229), 866 states have internal predecessors, (1229), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 14:01:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1365 transitions. [2025-03-08 14:01:17,048 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1365 transitions. Word has length 144 [2025-03-08 14:01:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:17,049 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1365 transitions. [2025-03-08 14:01:17,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 14:01:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1365 transitions. [2025-03-08 14:01:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:17,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:17,051 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-08 14:01:17,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 14:01:17,051 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 260984414, now seen corresponding path program 1 times [2025-03-08 14:01:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684848568] [2025-03-08 14:01:17,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:17,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:17,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:17,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:17,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:01:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684848568] [2025-03-08 14:01:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684848568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 14:01:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518399577] [2025-03-08 14:01:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:18,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 14:01:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 14:01:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:01:18,831 INFO L87 Difference]: Start difference. First operand 939 states and 1365 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:01:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:19,989 INFO L93 Difference]: Finished difference Result 1897 states and 2690 transitions. [2025-03-08 14:01:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 14:01:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-08 14:01:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:19,994 INFO L225 Difference]: With dead ends: 1897 [2025-03-08 14:01:19,994 INFO L226 Difference]: Without dead ends: 1359 [2025-03-08 14:01:19,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:01:19,996 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 434 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:19,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 951 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:01:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-03-08 14:01:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 883. [2025-03-08 14:01:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 809 states have (on average 1.4388133498145859) internal successors, (1164), 814 states have internal predecessors, (1164), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 14:01:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1292 transitions. [2025-03-08 14:01:20,051 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1292 transitions. Word has length 144 [2025-03-08 14:01:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:20,052 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1292 transitions. [2025-03-08 14:01:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:01:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1292 transitions. [2025-03-08 14:01:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:01:20,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:20,053 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-08 14:01:20,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 14:01:20,053 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:20,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash -736087939, now seen corresponding path program 1 times [2025-03-08 14:01:20,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:20,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306031063] [2025-03-08 14:01:20,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:20,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:01:20,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:01:20,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:20,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:22,072 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-08 14:01:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:01:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306031063] [2025-03-08 14:01:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306031063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:22,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:22,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:01:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788315985] [2025-03-08 14:01:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:01:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:01:22,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:01:22,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:01:22,074 INFO L87 Difference]: Start difference. First operand 883 states and 1292 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-08 14:01:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:22,849 INFO L93 Difference]: Finished difference Result 1700 states and 2420 transitions. [2025-03-08 14:01:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 14:01:22,850 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-08 14:01:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:22,854 INFO L225 Difference]: With dead ends: 1700 [2025-03-08 14:01:22,854 INFO L226 Difference]: Without dead ends: 1271 [2025-03-08 14:01:22,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-03-08 14:01:22,856 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 330 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:01:22,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 859 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:01:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-08 14:01:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 907. [2025-03-08 14:01:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 827 states have (on average 1.426844014510278) internal successors, (1180), 834 states have internal predecessors, (1180), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 14:01:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1316 transitions. [2025-03-08 14:01:22,912 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1316 transitions. Word has length 144 [2025-03-08 14:01:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1316 transitions. [2025-03-08 14:01:22,913 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-08 14:01:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1316 transitions. [2025-03-08 14:01:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 14:01:22,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:22,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, 1, 1, 1] [2025-03-08 14:01:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 14:01:22,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1677593521, now seen corresponding path program 1 times [2025-03-08 14:01:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:01:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539653678] [2025-03-08 14:01:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:01:22,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:01:22,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:01:22,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:22,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:51,620 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 171 DAG size of output: 167 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)