./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.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 2197c4d14fd5af1bc627adef461bd5f05d36e421274b7d409fe23e38f5f15829 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:36:35,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:36:35,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:36:35,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:36:35,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:36:35,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:36:35,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:36:35,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:36:35,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:36:35,989 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:36:35,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:36:35,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:36:35,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:36:35,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:36:35,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:36:35,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:36:35,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:36:35,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:36:35,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:35,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:36:35,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:36:35,993 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 -> 2197c4d14fd5af1bc627adef461bd5f05d36e421274b7d409fe23e38f5f15829 [2025-03-04 00:36:36,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:36:36,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:36:36,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:36:36,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:36:36,232 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:36:36,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i [2025-03-04 00:36:37,410 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ad216b/023f4debebb94998bf5d8d3be3a94221/FLAG1b1db7f37 [2025-03-04 00:36:37,748 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:36:37,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i [2025-03-04 00:36:37,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ad216b/023f4debebb94998bf5d8d3be3a94221/FLAG1b1db7f37 [2025-03-04 00:36:37,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159ad216b/023f4debebb94998bf5d8d3be3a94221 [2025-03-04 00:36:37,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:36:37,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:36:37,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:37,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:36:37,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:36:37,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:37" (1/1) ... [2025-03-04 00:36:37,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:37, skipping insertion in model container [2025-03-04 00:36:37,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:37" (1/1) ... [2025-03-04 00:36:37,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:36:37,960 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_operatoramount_amount500_file-8.i[915,928] [2025-03-04 00:36:38,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:38,182 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:36:38,189 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_operatoramount_amount500_file-8.i[915,928] [2025-03-04 00:36:38,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:38,309 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:36:38,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38 WrapperNode [2025-03-04 00:36:38,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:38,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:38,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:36:38,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:36:38,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,429 INFO L138 Inliner]: procedures = 26, calls = 91, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 828 [2025-03-04 00:36:38,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:38,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:36:38,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:36:38,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:36:38,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,549 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-04 00:36:38,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:36:38,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:36:38,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:36:38,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:36:38,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (1/1) ... [2025-03-04 00:36:38,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:38,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:38,650 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-04 00:36:38,652 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-04 00:36:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:36:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:36:38,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:36:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:36:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:36:38,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:36:38,800 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:36:38,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:36:39,765 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short71#1;havoc property_#t~bitwise72#1;havoc property_#t~short73#1; [2025-03-04 00:36:39,950 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-04 00:36:39,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:36:39,983 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:36:39,983 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:36:39,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:39 BoogieIcfgContainer [2025-03-04 00:36:39,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:36:39,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:36:39,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:36:39,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:36:39,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:37" (1/3) ... [2025-03-04 00:36:39,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179059f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:39, skipping insertion in model container [2025-03-04 00:36:39,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:38" (2/3) ... [2025-03-04 00:36:39,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179059f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:39, skipping insertion in model container [2025-03-04 00:36:39,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:39" (3/3) ... [2025-03-04 00:36:39,990 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-8.i [2025-03-04 00:36:40,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:36:40,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-8.i that has 2 procedures, 330 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:36:40,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:36:40,082 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;@773802ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:36:40,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:36:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 250 states have internal predecessors, (377), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 00:36:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:40,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:40,118 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:40,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -903879789, now seen corresponding path program 1 times [2025-03-04 00:36:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775311493] [2025-03-04 00:36:40,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:40,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:40,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:40,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:40,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:40,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-04 00:36:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775311493] [2025-03-04 00:36:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775311493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312829425] [2025-03-04 00:36:40,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:40,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:40,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:40,793 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-04 00:36:40,794 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-04 00:36:41,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:41,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:41,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:41,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:41,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:36:41,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-03-04 00:36:41,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:36:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312829425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:36:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:36:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998161121] [2025-03-04 00:36:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:41,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:36:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:36:41,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:36:41,315 INFO L87 Difference]: Start difference. First operand has 330 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 250 states have internal predecessors, (377), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:36:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:41,407 INFO L93 Difference]: Finished difference Result 654 states and 1139 transitions. [2025-03-04 00:36:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:36:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) Word has length 555 [2025-03-04 00:36:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:41,419 INFO L225 Difference]: With dead ends: 654 [2025-03-04 00:36:41,420 INFO L226 Difference]: Without dead ends: 327 [2025-03-04 00:36:41,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 556 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-04 00:36:41,430 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:41,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:36:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-04 00:36:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-04 00:36:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 247 states have internal predecessors, (369), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 00:36:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 525 transitions. [2025-03-04 00:36:41,515 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 525 transitions. Word has length 555 [2025-03-04 00:36:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:41,517 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 525 transitions. [2025-03-04 00:36:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-03-04 00:36:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 525 transitions. [2025-03-04 00:36:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:41,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:41,530 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:41,539 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-04 00:36:41,730 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-04 00:36:41,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:41,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1738453035, now seen corresponding path program 1 times [2025-03-04 00:36:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232223705] [2025-03-04 00:36:41,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:41,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:41,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:41,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:41,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:42,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:42,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232223705] [2025-03-04 00:36:42,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232223705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:42,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161759866] [2025-03-04 00:36:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:42,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:42,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:42,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:42,400 INFO L87 Difference]: Start difference. First operand 327 states and 525 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:42,521 INFO L93 Difference]: Finished difference Result 861 states and 1376 transitions. [2025-03-04 00:36:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:42,529 INFO L225 Difference]: With dead ends: 861 [2025-03-04 00:36:42,529 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 00:36:42,530 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-04 00:36:42,531 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 321 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:42,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1062 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 00:36:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534. [2025-03-04 00:36:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 427 states have (on average 1.4988290398126465) internal successors, (640), 428 states have internal predecessors, (640), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-04 00:36:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 848 transitions. [2025-03-04 00:36:42,585 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 848 transitions. Word has length 555 [2025-03-04 00:36:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:42,587 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 848 transitions. [2025-03-04 00:36:42,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 848 transitions. [2025-03-04 00:36:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:42,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:42,596 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:42,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:36:42,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:42,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash 702168724, now seen corresponding path program 1 times [2025-03-04 00:36:42,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:42,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56026958] [2025-03-04 00:36:42,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:42,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:42,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:42,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56026958] [2025-03-04 00:36:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56026958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592947477] [2025-03-04 00:36:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:42,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:42,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:42,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:42,984 INFO L87 Difference]: Start difference. First operand 534 states and 848 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:43,098 INFO L93 Difference]: Finished difference Result 1472 states and 2332 transitions. [2025-03-04 00:36:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:43,105 INFO L225 Difference]: With dead ends: 1472 [2025-03-04 00:36:43,105 INFO L226 Difference]: Without dead ends: 941 [2025-03-04 00:36:43,106 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-04 00:36:43,107 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 324 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:43,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1075 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-04 00:36:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2025-03-04 00:36:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 775 states have (on average 1.504516129032258) internal successors, (1166), 778 states have internal predecessors, (1166), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 155 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-04 00:36:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1482 transitions. [2025-03-04 00:36:43,170 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1482 transitions. Word has length 555 [2025-03-04 00:36:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1482 transitions. [2025-03-04 00:36:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1482 transitions. [2025-03-04 00:36:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:43,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:43,183 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:36:43,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:43,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1359388398, now seen corresponding path program 1 times [2025-03-04 00:36:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382553184] [2025-03-04 00:36:43,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:43,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:43,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:43,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:43,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382553184] [2025-03-04 00:36:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382553184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561620752] [2025-03-04 00:36:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:43,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:43,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:43,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:43,725 INFO L87 Difference]: Start difference. First operand 938 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:43,852 INFO L93 Difference]: Finished difference Result 2327 states and 3658 transitions. [2025-03-04 00:36:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:43,863 INFO L225 Difference]: With dead ends: 2327 [2025-03-04 00:36:43,864 INFO L226 Difference]: Without dead ends: 1392 [2025-03-04 00:36:43,867 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-04 00:36:43,868 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:43,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1016 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-04 00:36:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2025-03-04 00:36:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1167 states have (on average 1.4927163667523564) internal successors, (1742), 1174 states have internal predecessors, (1742), 210 states have call successors, (210), 8 states have call predecessors, (210), 8 states have return successors, (210), 203 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-04 00:36:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2162 transitions. [2025-03-04 00:36:43,942 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2162 transitions. Word has length 555 [2025-03-04 00:36:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:43,943 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2162 transitions. [2025-03-04 00:36:43,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2162 transitions. [2025-03-04 00:36:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:43,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:43,948 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:43,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:36:43,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:43,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash -852398800, now seen corresponding path program 1 times [2025-03-04 00:36:43,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:43,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030687219] [2025-03-04 00:36:43,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:43,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:44,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:44,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:44,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:45,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:45,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030687219] [2025-03-04 00:36:45,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030687219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:36:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971601275] [2025-03-04 00:36:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:45,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:36:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:36:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:36:45,413 INFO L87 Difference]: Start difference. First operand 1386 states and 2162 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:47,103 INFO L93 Difference]: Finished difference Result 6247 states and 9738 transitions. [2025-03-04 00:36:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:36:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:47,124 INFO L225 Difference]: With dead ends: 6247 [2025-03-04 00:36:47,125 INFO L226 Difference]: Without dead ends: 4864 [2025-03-04 00:36:47,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:36:47,128 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 1583 mSDsluCounter, 3709 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:47,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 4618 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:36:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2025-03-04 00:36:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4012. [2025-03-04 00:36:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4012 states, 3344 states have (on average 1.485645933014354) internal successors, (4968), 3367 states have internal predecessors, (4968), 642 states have call successors, (642), 25 states have call predecessors, (642), 25 states have return successors, (642), 619 states have call predecessors, (642), 642 states have call successors, (642) [2025-03-04 00:36:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 6252 transitions. [2025-03-04 00:36:47,340 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 6252 transitions. Word has length 555 [2025-03-04 00:36:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:47,341 INFO L471 AbstractCegarLoop]: Abstraction has 4012 states and 6252 transitions. [2025-03-04 00:36:47,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 6252 transitions. [2025-03-04 00:36:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:47,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:47,349 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:36:47,350 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash 117182223, now seen corresponding path program 1 times [2025-03-04 00:36:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599673528] [2025-03-04 00:36:47,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599673528] [2025-03-04 00:36:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599673528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437324943] [2025-03-04 00:36:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:47,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:47,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:47,751 INFO L87 Difference]: Start difference. First operand 4012 states and 6252 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:48,060 INFO L93 Difference]: Finished difference Result 11884 states and 18514 transitions. [2025-03-04 00:36:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:48,096 INFO L225 Difference]: With dead ends: 11884 [2025-03-04 00:36:48,097 INFO L226 Difference]: Without dead ends: 7948 [2025-03-04 00:36:48,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:48,109 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 379 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:48,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1473 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2025-03-04 00:36:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 7946. [2025-03-04 00:36:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7946 states, 6656 states have (on average 1.4876802884615385) internal successors, (9902), 6701 states have internal predecessors, (9902), 1239 states have call successors, (1239), 50 states have call predecessors, (1239), 50 states have return successors, (1239), 1194 states have call predecessors, (1239), 1239 states have call successors, (1239) [2025-03-04 00:36:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 12380 transitions. [2025-03-04 00:36:48,505 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 12380 transitions. Word has length 555 [2025-03-04 00:36:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:48,506 INFO L471 AbstractCegarLoop]: Abstraction has 7946 states and 12380 transitions. [2025-03-04 00:36:48,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 12380 transitions. [2025-03-04 00:36:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-04 00:36:48,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:48,518 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:36:48,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -836019410, now seen corresponding path program 1 times [2025-03-04 00:36:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756971489] [2025-03-04 00:36:48,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-04 00:36:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-04 00:36:48,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:48,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:49,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756971489] [2025-03-04 00:36:49,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756971489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:49,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:49,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:36:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943812599] [2025-03-04 00:36:49,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:49,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:36:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:36:49,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:36:49,382 INFO L87 Difference]: Start difference. First operand 7946 states and 12380 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:52,261 INFO L93 Difference]: Finished difference Result 32205 states and 50042 transitions. [2025-03-04 00:36:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:36:52,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-03-04 00:36:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:52,361 INFO L225 Difference]: With dead ends: 32205 [2025-03-04 00:36:52,361 INFO L226 Difference]: Without dead ends: 24335 [2025-03-04 00:36:52,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:36:52,384 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 2146 mSDsluCounter, 5273 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 6359 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:52,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 6359 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:36:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24335 states. [2025-03-04 00:36:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24335 to 15928. [2025-03-04 00:36:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15928 states, 13485 states have (on average 1.4937337782721543) internal successors, (20143), 13576 states have internal predecessors, (20143), 2343 states have call successors, (2343), 99 states have call predecessors, (2343), 99 states have return successors, (2343), 2252 states have call predecessors, (2343), 2343 states have call successors, (2343) [2025-03-04 00:36:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15928 states to 15928 states and 24829 transitions. [2025-03-04 00:36:53,121 INFO L78 Accepts]: Start accepts. Automaton has 15928 states and 24829 transitions. Word has length 555 [2025-03-04 00:36:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:53,122 INFO L471 AbstractCegarLoop]: Abstraction has 15928 states and 24829 transitions. [2025-03-04 00:36:53,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 15928 states and 24829 transitions. [2025-03-04 00:36:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-04 00:36:53,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:53,142 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:53,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:36:53,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:53,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1821382922, now seen corresponding path program 1 times [2025-03-04 00:36:53,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:53,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001140733] [2025-03-04 00:36:53,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-04 00:36:53,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-04 00:36:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:53,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001140733] [2025-03-04 00:36:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001140733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988267908] [2025-03-04 00:36:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:54,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:54,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:54,024 INFO L87 Difference]: Start difference. First operand 15928 states and 24829 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:55,463 INFO L93 Difference]: Finished difference Result 58882 states and 91874 transitions. [2025-03-04 00:36:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 556 [2025-03-04 00:36:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:55,585 INFO L225 Difference]: With dead ends: 58882 [2025-03-04 00:36:55,585 INFO L226 Difference]: Without dead ends: 43030 [2025-03-04 00:36:55,634 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-04 00:36:55,634 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 674 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:55,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1704 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:36:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43030 states. [2025-03-04 00:36:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43030 to 31688. [2025-03-04 00:36:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31688 states, 26848 states have (on average 1.481898092967819) internal successors, (39786), 27029 states have internal predecessors, (39786), 4641 states have call successors, (4641), 198 states have call predecessors, (4641), 198 states have return successors, (4641), 4460 states have call predecessors, (4641), 4641 states have call successors, (4641) [2025-03-04 00:36:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31688 states to 31688 states and 49068 transitions. [2025-03-04 00:36:56,968 INFO L78 Accepts]: Start accepts. Automaton has 31688 states and 49068 transitions. Word has length 556 [2025-03-04 00:36:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:56,970 INFO L471 AbstractCegarLoop]: Abstraction has 31688 states and 49068 transitions. [2025-03-04 00:36:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:36:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 31688 states and 49068 transitions. [2025-03-04 00:36:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-04 00:36:57,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:57,007 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:36:57,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:57,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1466567661, now seen corresponding path program 1 times [2025-03-04 00:36:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101842272] [2025-03-04 00:36:57,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-04 00:36:57,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-04 00:36:57,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:57,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:36:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101842272] [2025-03-04 00:36:58,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101842272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:58,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:58,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 00:36:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395224134] [2025-03-04 00:36:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:58,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:36:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:58,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:36:58,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:36:58,834 INFO L87 Difference]: Start difference. First operand 31688 states and 49068 transitions. Second operand has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:09,942 INFO L93 Difference]: Finished difference Result 261202 states and 405475 transitions. [2025-03-04 00:37:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 00:37:09,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 557 [2025-03-04 00:37:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:10,570 INFO L225 Difference]: With dead ends: 261202 [2025-03-04 00:37:10,570 INFO L226 Difference]: Without dead ends: 245524 [2025-03-04 00:37:10,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=517, Invalid=1553, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 00:37:10,648 INFO L435 NwaCegarLoop]: 1196 mSDtfsCounter, 6805 mSDsluCounter, 9298 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 1059 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6805 SdHoareTripleChecker+Valid, 10494 SdHoareTripleChecker+Invalid, 5304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1059 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:10,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6805 Valid, 10494 Invalid, 5304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1059 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 00:37:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245524 states. [2025-03-04 00:37:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245524 to 64542. [2025-03-04 00:37:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64542 states, 55199 states have (on average 1.4874001340603997) internal successors, (82103), 55568 states have internal predecessors, (82103), 8949 states have call successors, (8949), 393 states have call predecessors, (8949), 393 states have return successors, (8949), 8580 states have call predecessors, (8949), 8949 states have call successors, (8949) [2025-03-04 00:37:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64542 states to 64542 states and 100001 transitions. [2025-03-04 00:37:15,634 INFO L78 Accepts]: Start accepts. Automaton has 64542 states and 100001 transitions. Word has length 557 [2025-03-04 00:37:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:15,635 INFO L471 AbstractCegarLoop]: Abstraction has 64542 states and 100001 transitions. [2025-03-04 00:37:15,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.625) internal successors, (170), 16 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 64542 states and 100001 transitions. [2025-03-04 00:37:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-04 00:37:15,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:15,699 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:15,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:15,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:15,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -357752462, now seen corresponding path program 1 times [2025-03-04 00:37:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117094185] [2025-03-04 00:37:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:15,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-04 00:37:16,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-04 00:37:16,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:16,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:37:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117094185] [2025-03-04 00:37:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117094185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697388038] [2025-03-04 00:37:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:17,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:17,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:17,384 INFO L87 Difference]: Start difference. First operand 64542 states and 100001 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:20,522 INFO L93 Difference]: Finished difference Result 150528 states and 233244 transitions. [2025-03-04 00:37:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 557 [2025-03-04 00:37:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:20,729 INFO L225 Difference]: With dead ends: 150528 [2025-03-04 00:37:20,730 INFO L226 Difference]: Without dead ends: 86066 [2025-03-04 00:37:20,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:20,824 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 670 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:20,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 2226 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86066 states. [2025-03-04 00:37:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86066 to 64534. [2025-03-04 00:37:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64534 states, 55191 states have (on average 1.4871808809407332) internal successors, (82079), 55560 states have internal predecessors, (82079), 8949 states have call successors, (8949), 393 states have call predecessors, (8949), 393 states have return successors, (8949), 8580 states have call predecessors, (8949), 8949 states have call successors, (8949) [2025-03-04 00:37:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64534 states to 64534 states and 99977 transitions. [2025-03-04 00:37:25,277 INFO L78 Accepts]: Start accepts. Automaton has 64534 states and 99977 transitions. Word has length 557 [2025-03-04 00:37:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:25,278 INFO L471 AbstractCegarLoop]: Abstraction has 64534 states and 99977 transitions. [2025-03-04 00:37:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 64534 states and 99977 transitions. [2025-03-04 00:37:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-04 00:37:25,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:25,329 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:25,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:37:25,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:25,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:25,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1444757169, now seen corresponding path program 1 times [2025-03-04 00:37:25,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:25,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151596458] [2025-03-04 00:37:25,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:25,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-04 00:37:25,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-04 00:37:25,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:25,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:37:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151596458] [2025-03-04 00:37:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151596458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:25,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:25,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612088530] [2025-03-04 00:37:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:25,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:25,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:25,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:25,938 INFO L87 Difference]: Start difference. First operand 64534 states and 99977 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:30,316 INFO L93 Difference]: Finished difference Result 172853 states and 267809 transitions. [2025-03-04 00:37:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 557 [2025-03-04 00:37:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:30,570 INFO L225 Difference]: With dead ends: 172853 [2025-03-04 00:37:30,570 INFO L226 Difference]: Without dead ends: 108399 [2025-03-04 00:37:30,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-04 00:37:30,668 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 398 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:30,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1474 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108399 states. [2025-03-04 00:37:34,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108399 to 89389. [2025-03-04 00:37:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89389 states, 80012 states have (on average 1.5362320651902215) internal successors, (122917), 80380 states have internal predecessors, (122917), 8982 states have call successors, (8982), 394 states have call predecessors, (8982), 394 states have return successors, (8982), 8614 states have call predecessors, (8982), 8982 states have call successors, (8982) [2025-03-04 00:37:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89389 states to 89389 states and 140881 transitions. [2025-03-04 00:37:34,375 INFO L78 Accepts]: Start accepts. Automaton has 89389 states and 140881 transitions. Word has length 557 [2025-03-04 00:37:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:34,376 INFO L471 AbstractCegarLoop]: Abstraction has 89389 states and 140881 transitions. [2025-03-04 00:37:34,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 89389 states and 140881 transitions. [2025-03-04 00:37:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-04 00:37:34,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:34,424 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:37:34,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:34,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 702095407, now seen corresponding path program 1 times [2025-03-04 00:37:34,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:34,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558577458] [2025-03-04 00:37:34,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:34,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-03-04 00:37:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-03-04 00:37:34,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-03-04 00:37:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558577458] [2025-03-04 00:37:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558577458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:34,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977493764] [2025-03-04 00:37:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:34,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:34,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:34,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:34,856 INFO L87 Difference]: Start difference. First operand 89389 states and 140881 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-03-04 00:37:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:37,796 INFO L93 Difference]: Finished difference Result 174495 states and 274772 transitions. [2025-03-04 00:37:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 558 [2025-03-04 00:37:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:38,000 INFO L225 Difference]: With dead ends: 174495 [2025-03-04 00:37:38,000 INFO L226 Difference]: Without dead ends: 89321 [2025-03-04 00:37:38,108 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-04 00:37:38,109 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:38,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1011 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:37:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89321 states.