./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-75.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 39440d444684353bf21e24f176d5fedee371419507f0ad109966d3b62ac38d18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:47:21,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:47:21,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:47:21,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:47:21,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:47:21,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:47:21,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:47:21,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:47:21,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:47:21,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:47:21,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:47:21,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:47:21,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:47:21,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:47:21,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:47:21,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:47:21,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:47:21,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:47:21,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:21,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:47:21,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:47:21,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:47:21,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:47:21,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:47:21,484 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 -> 39440d444684353bf21e24f176d5fedee371419507f0ad109966d3b62ac38d18 [2025-03-08 15:47:21,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:47:21,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:47:21,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:47:21,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:47:21,739 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:47:21,740 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-75.i [2025-03-08 15:47:22,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0527fe418/78ab55691ec24d30b43a58c1aa28ace3/FLAG2563cbd8d [2025-03-08 15:47:23,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:47:23,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-75.i [2025-03-08 15:47:23,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0527fe418/78ab55691ec24d30b43a58c1aa28ace3/FLAG2563cbd8d [2025-03-08 15:47:23,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0527fe418/78ab55691ec24d30b43a58c1aa28ace3 [2025-03-08 15:47:23,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:47:23,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:47:23,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:23,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:47:23,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:47:23,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:23,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23, skipping insertion in model container [2025-03-08 15:47:23,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:23,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:47:23,577 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-75.i[916,929] [2025-03-08 15:47:23,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:23,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:47:23,770 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-75.i[916,929] [2025-03-08 15:47:23,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:23,874 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:47:23,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23 WrapperNode [2025-03-08 15:47:23,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:23,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:23,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:47:23,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:47:23,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:23,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:23,983 INFO L138 Inliner]: procedures = 26, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 718 [2025-03-08 15:47:23,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:23,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:47:23,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:47:23,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:47:23,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:23,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:47:24,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:47:24,173 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:47:24,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:47:24,174 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:47:24,175 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (1/1) ... [2025-03-08 15:47:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:24,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:24,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:47:24,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:47:24,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:47:24,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:47:24,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:47:24,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:47:24,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:47:24,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:47:24,353 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:47:24,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:47:25,297 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise51#1;havoc property_#t~short52#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1; [2025-03-08 15:47:25,468 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-03-08 15:47:25,469 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:47:25,498 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:47:25,498 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:47:25,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:25 BoogieIcfgContainer [2025-03-08 15:47:25,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:47:25,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:47:25,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:47:25,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:47:25,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:47:23" (1/3) ... [2025-03-08 15:47:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457ae532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:25, skipping insertion in model container [2025-03-08 15:47:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:23" (2/3) ... [2025-03-08 15:47:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457ae532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:25, skipping insertion in model container [2025-03-08 15:47:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:25" (3/3) ... [2025-03-08 15:47:25,507 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-75.i [2025-03-08 15:47:25,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:47:25,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-75.i that has 2 procedures, 292 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:47:25,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:47:25,591 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;@9386488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:47:25,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:47:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 213 states have (on average 1.511737089201878) internal successors, (322), 214 states have internal predecessors, (322), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:47:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 15:47:25,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:25,630 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:25,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:25,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash -175052405, now seen corresponding path program 1 times [2025-03-08 15:47:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170262379] [2025-03-08 15:47:25,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:25,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:25,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:25,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 15:47:26,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170262379] [2025-03-08 15:47:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170262379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978048620] [2025-03-08 15:47:26,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:26,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:26,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:47:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:26,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:26,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:26,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:26,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:47:26,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2025-03-08 15:47:26,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:47:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978048620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:47:26,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:47:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861040678] [2025-03-08 15:47:26,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:47:26,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:26,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:47:26,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:47:26,781 INFO L87 Difference]: Start difference. First operand has 292 states, 213 states have (on average 1.511737089201878) internal successors, (322), 214 states have internal predecessors, (322), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:47:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:26,835 INFO L93 Difference]: Finished difference Result 578 states and 1019 transitions. [2025-03-08 15:47:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:47:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 520 [2025-03-08 15:47:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:26,846 INFO L225 Difference]: With dead ends: 578 [2025-03-08 15:47:26,847 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 15:47:26,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:47:26,855 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:26,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:47:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 15:47:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-08 15:47:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 211 states have (on average 1.5023696682464456) internal successors, (317), 211 states have internal predecessors, (317), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:47:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 469 transitions. [2025-03-08 15:47:26,918 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 469 transitions. Word has length 520 [2025-03-08 15:47:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:26,918 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 469 transitions. [2025-03-08 15:47:26,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (76), 2 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2025-03-08 15:47:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 469 transitions. [2025-03-08 15:47:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 15:47:26,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:26,928 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:26,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:47:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:47:27,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -296073423, now seen corresponding path program 1 times [2025-03-08 15:47:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565190133] [2025-03-08 15:47:27,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:27,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:27,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:27,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:27,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565190133] [2025-03-08 15:47:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565190133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087620467] [2025-03-08 15:47:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:27,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:27,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:27,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:27,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:27,719 INFO L87 Difference]: Start difference. First operand 289 states and 469 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:27,920 INFO L93 Difference]: Finished difference Result 854 states and 1389 transitions. [2025-03-08 15:47:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 520 [2025-03-08 15:47:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:27,927 INFO L225 Difference]: With dead ends: 854 [2025-03-08 15:47:27,929 INFO L226 Difference]: Without dead ends: 568 [2025-03-08 15:47:27,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:27,931 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 450 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:27,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1163 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-08 15:47:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 292. [2025-03-08 15:47:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 214 states have (on average 1.5) internal successors, (321), 214 states have internal predecessors, (321), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:47:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 473 transitions. [2025-03-08 15:47:27,981 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 473 transitions. Word has length 520 [2025-03-08 15:47:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:27,984 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 473 transitions. [2025-03-08 15:47:27,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 473 transitions. [2025-03-08 15:47:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 15:47:27,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:27,991 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:27,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:47:27,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:27,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1462769742, now seen corresponding path program 1 times [2025-03-08 15:47:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193409534] [2025-03-08 15:47:27,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:28,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:28,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:28,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193409534] [2025-03-08 15:47:28,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193409534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:28,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338693451] [2025-03-08 15:47:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:28,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:28,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:28,367 INFO L87 Difference]: Start difference. First operand 292 states and 473 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:28,467 INFO L93 Difference]: Finished difference Result 870 states and 1413 transitions. [2025-03-08 15:47:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 520 [2025-03-08 15:47:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:28,472 INFO L225 Difference]: With dead ends: 870 [2025-03-08 15:47:28,472 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 15:47:28,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:28,473 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 448 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:28,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1181 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 15:47:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2025-03-08 15:47:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 424 states have (on average 1.4976415094339623) internal successors, (635), 424 states have internal predecessors, (635), 152 states have call successors, (152), 2 states have call predecessors, (152), 2 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-08 15:47:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 939 transitions. [2025-03-08 15:47:28,536 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 939 transitions. Word has length 520 [2025-03-08 15:47:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:28,537 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 939 transitions. [2025-03-08 15:47:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 939 transitions. [2025-03-08 15:47:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 15:47:28,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:28,543 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:28,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:47:28,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:28,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1648850257, now seen corresponding path program 1 times [2025-03-08 15:47:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:28,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746811411] [2025-03-08 15:47:28,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:28,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:28,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:28,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:28,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746811411] [2025-03-08 15:47:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746811411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:29,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440811044] [2025-03-08 15:47:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:29,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:29,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:29,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:29,642 INFO L87 Difference]: Start difference. First operand 579 states and 939 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:30,135 INFO L93 Difference]: Finished difference Result 1861 states and 3013 transitions. [2025-03-08 15:47:30,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 520 [2025-03-08 15:47:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:30,144 INFO L225 Difference]: With dead ends: 1861 [2025-03-08 15:47:30,144 INFO L226 Difference]: Without dead ends: 1285 [2025-03-08 15:47:30,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:30,147 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 495 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:30,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2204 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-08 15:47:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1029. [2025-03-08 15:47:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 814 states have (on average 1.5196560196560196) internal successors, (1237), 816 states have internal predecessors, (1237), 210 states have call successors, (210), 4 states have call predecessors, (210), 4 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-08 15:47:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1657 transitions. [2025-03-08 15:47:30,235 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1657 transitions. Word has length 520 [2025-03-08 15:47:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:30,238 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1657 transitions. [2025-03-08 15:47:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1657 transitions. [2025-03-08 15:47:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-08 15:47:30,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:30,249 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:30,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:47:30,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:30,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1876947024, now seen corresponding path program 1 times [2025-03-08 15:47:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602649793] [2025-03-08 15:47:30,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:30,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-08 15:47:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-08 15:47:30,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602649793] [2025-03-08 15:47:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602649793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:30,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966041479] [2025-03-08 15:47:30,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:30,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:30,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:30,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:30,806 INFO L87 Difference]: Start difference. First operand 1029 states and 1657 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:30,861 INFO L93 Difference]: Finished difference Result 2055 states and 3311 transitions. [2025-03-08 15:47:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:30,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 520 [2025-03-08 15:47:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:30,869 INFO L225 Difference]: With dead ends: 2055 [2025-03-08 15:47:30,869 INFO L226 Difference]: Without dead ends: 1029 [2025-03-08 15:47:30,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:30,872 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 0 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 919 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-08 15:47:30,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 919 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:47:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-08 15:47:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1005. [2025-03-08 15:47:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 790 states have (on average 1.5050632911392405) internal successors, (1189), 792 states have internal predecessors, (1189), 210 states have call successors, (210), 4 states have call predecessors, (210), 4 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-08 15:47:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1609 transitions. [2025-03-08 15:47:30,922 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1609 transitions. Word has length 520 [2025-03-08 15:47:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:30,922 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1609 transitions. [2025-03-08 15:47:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1609 transitions. [2025-03-08 15:47:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-08 15:47:30,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:30,928 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:30,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:47:30,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2050901899, now seen corresponding path program 1 times [2025-03-08 15:47:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106937701] [2025-03-08 15:47:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:30,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-08 15:47:31,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-08 15:47:31,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:31,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106937701] [2025-03-08 15:47:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106937701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287742395] [2025-03-08 15:47:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:33,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:33,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:33,110 INFO L87 Difference]: Start difference. First operand 1005 states and 1609 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:33,877 INFO L93 Difference]: Finished difference Result 3773 states and 6027 transitions. [2025-03-08 15:47:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 521 [2025-03-08 15:47:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:33,893 INFO L225 Difference]: With dead ends: 3773 [2025-03-08 15:47:33,894 INFO L226 Difference]: Without dead ends: 2771 [2025-03-08 15:47:33,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:33,899 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 966 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:33,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1580 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:47:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-03-08 15:47:34,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2094. [2025-03-08 15:47:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1693 states have (on average 1.5044300059066746) internal successors, (2547), 1699 states have internal predecessors, (2547), 392 states have call successors, (392), 8 states have call predecessors, (392), 8 states have return successors, (392), 386 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-08 15:47:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3331 transitions. [2025-03-08 15:47:34,040 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3331 transitions. Word has length 521 [2025-03-08 15:47:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 2094 states and 3331 transitions. [2025-03-08 15:47:34,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3331 transitions. [2025-03-08 15:47:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-08 15:47:34,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:34,046 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:34,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:47:34,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 565846348, now seen corresponding path program 1 times [2025-03-08 15:47:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769312092] [2025-03-08 15:47:34,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:34,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-08 15:47:34,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-08 15:47:34,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:34,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769312092] [2025-03-08 15:47:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769312092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942082076] [2025-03-08 15:47:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:34,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:34,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:34,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:34,269 INFO L87 Difference]: Start difference. First operand 2094 states and 3331 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:34,504 INFO L93 Difference]: Finished difference Result 5805 states and 9255 transitions. [2025-03-08 15:47:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 521 [2025-03-08 15:47:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:34,526 INFO L225 Difference]: With dead ends: 5805 [2025-03-08 15:47:34,526 INFO L226 Difference]: Without dead ends: 3714 [2025-03-08 15:47:34,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:34,531 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 408 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:34,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1256 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2025-03-08 15:47:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 2746. [2025-03-08 15:47:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2345 states have (on average 1.542857142857143) internal successors, (3618), 2351 states have internal predecessors, (3618), 392 states have call successors, (392), 8 states have call predecessors, (392), 8 states have return successors, (392), 386 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-08 15:47:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4402 transitions. [2025-03-08 15:47:34,790 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4402 transitions. Word has length 521 [2025-03-08 15:47:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:34,791 INFO L471 AbstractCegarLoop]: Abstraction has 2746 states and 4402 transitions. [2025-03-08 15:47:34,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4402 transitions. [2025-03-08 15:47:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 15:47:34,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:34,800 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:47:34,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash 222490600, now seen corresponding path program 1 times [2025-03-08 15:47:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225042151] [2025-03-08 15:47:34,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:34,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 15:47:35,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 15:47:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225042151] [2025-03-08 15:47:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225042151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231406838] [2025-03-08 15:47:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:36,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:36,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:36,333 INFO L87 Difference]: Start difference. First operand 2746 states and 4402 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:37,217 INFO L93 Difference]: Finished difference Result 7743 states and 12424 transitions. [2025-03-08 15:47:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:37,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 522 [2025-03-08 15:47:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:37,239 INFO L225 Difference]: With dead ends: 7743 [2025-03-08 15:47:37,239 INFO L226 Difference]: Without dead ends: 5000 [2025-03-08 15:47:37,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:37,245 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1167 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:37,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1077 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:47:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2025-03-08 15:47:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 2284. [2025-03-08 15:47:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2067 states have (on average 1.5452346395742622) internal successors, (3194), 2069 states have internal predecessors, (3194), 210 states have call successors, (210), 6 states have call predecessors, (210), 6 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-08 15:47:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3614 transitions. [2025-03-08 15:47:37,422 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3614 transitions. Word has length 522 [2025-03-08 15:47:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 3614 transitions. [2025-03-08 15:47:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3614 transitions. [2025-03-08 15:47:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 15:47:37,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:37,430 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:47:37,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 214731241, now seen corresponding path program 1 times [2025-03-08 15:47:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155125669] [2025-03-08 15:47:37,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:37,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 15:47:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 15:47:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155125669] [2025-03-08 15:47:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155125669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:47:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156394399] [2025-03-08 15:47:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:47:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:47:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:39,074 INFO L87 Difference]: Start difference. First operand 2284 states and 3614 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:40,076 INFO L93 Difference]: Finished difference Result 7875 states and 12481 transitions. [2025-03-08 15:47:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:47:40,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 522 [2025-03-08 15:47:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:40,103 INFO L225 Difference]: With dead ends: 7875 [2025-03-08 15:47:40,103 INFO L226 Difference]: Without dead ends: 5472 [2025-03-08 15:47:40,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:40,111 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1697 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2112 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:47:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2025-03-08 15:47:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 3864. [2025-03-08 15:47:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3519 states have (on average 1.5524296675191815) internal successors, (5463), 3525 states have internal predecessors, (5463), 334 states have call successors, (334), 10 states have call predecessors, (334), 10 states have return successors, (334), 328 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-08 15:47:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 6131 transitions. [2025-03-08 15:47:40,314 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 6131 transitions. Word has length 522 [2025-03-08 15:47:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 3864 states and 6131 transitions. [2025-03-08 15:47:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 6131 transitions. [2025-03-08 15:47:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 15:47:40,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:40,323 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:47:40,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 725944392, now seen corresponding path program 1 times [2025-03-08 15:47:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924886255] [2025-03-08 15:47:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 15:47:40,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 15:47:40,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2025-03-08 15:47:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924886255] [2025-03-08 15:47:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924886255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363945310] [2025-03-08 15:47:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:41,779 INFO L87 Difference]: Start difference. First operand 3864 states and 6131 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:42,467 INFO L93 Difference]: Finished difference Result 8907 states and 14127 transitions. [2025-03-08 15:47:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 522 [2025-03-08 15:47:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:42,495 INFO L225 Difference]: With dead ends: 8907 [2025-03-08 15:47:42,495 INFO L226 Difference]: Without dead ends: 5046 [2025-03-08 15:47:42,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:42,503 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 767 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:42,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1824 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2025-03-08 15:47:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 3680. [2025-03-08 15:47:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3329 states have (on average 1.5512165815560228) internal successors, (5164), 3335 states have internal predecessors, (5164), 338 states have call successors, (338), 12 states have call predecessors, (338), 12 states have return successors, (338), 332 states have call predecessors, (338), 338 states have call successors, (338) [2025-03-08 15:47:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5840 transitions. [2025-03-08 15:47:42,687 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5840 transitions. Word has length 522 [2025-03-08 15:47:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5840 transitions. [2025-03-08 15:47:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2025-03-08 15:47:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5840 transitions. [2025-03-08 15:47:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 15:47:42,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:42,699 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:47:42,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1883275912, now seen corresponding path program 1 times [2025-03-08 15:47:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055981588] [2025-03-08 15:47:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:42,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 15:47:46,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 15:47:46,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:46,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-08 15:47:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055981588] [2025-03-08 15:47:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055981588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418572071] [2025-03-08 15:47:47,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:47,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:47,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:47:47,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-03-08 15:47:47,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-03-08 15:47:47,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:47,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:47,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5125 proven. 150 refuted. 0 times theorem prover too weak. 6125 trivial. 0 not checked. [2025-03-08 15:47:48,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 75 proven. 150 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2025-03-08 15:47:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418572071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:48,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-03-08 15:47:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448358099] [2025-03-08 15:47:48,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:48,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:47:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:48,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:47:48,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:47:48,817 INFO L87 Difference]: Start difference. First operand 3680 states and 5840 transitions. Second operand has 13 states, 13 states have (on average 22.307692307692307) internal successors, (290), 13 states have internal predecessors, (290), 5 states have call successors, (202), 2 states have call predecessors, (202), 4 states have return successors, (203), 4 states have call predecessors, (203), 5 states have call successors, (203) [2025-03-08 15:47:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:50,352 INFO L93 Difference]: Finished difference Result 13337 states and 21139 transitions. [2025-03-08 15:47:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:47:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.307692307692307) internal successors, (290), 13 states have internal predecessors, (290), 5 states have call successors, (202), 2 states have call predecessors, (202), 4 states have return successors, (203), 4 states have call predecessors, (203), 5 states have call successors, (203) Word has length 522 [2025-03-08 15:47:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:50,376 INFO L225 Difference]: With dead ends: 13337 [2025-03-08 15:47:50,377 INFO L226 Difference]: Without dead ends: 9660 [2025-03-08 15:47:50,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2025-03-08 15:47:50,385 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 4625 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4650 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 742 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:50,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4650 Valid, 2026 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [742 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:47:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9660 states. [2025-03-08 15:47:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9660 to 7245. [2025-03-08 15:47:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7245 states, 6806 states have (on average 1.552012929767852) internal successors, (10563), 6812 states have internal predecessors, (10563), 414 states have call successors, (414), 24 states have call predecessors, (414), 24 states have return successors, (414), 408 states have call predecessors, (414), 414 states have call successors, (414) [2025-03-08 15:47:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11391 transitions. [2025-03-08 15:47:50,858 INFO L78 Accepts]: Start accepts. Automaton has 7245 states and 11391 transitions. Word has length 522 [2025-03-08 15:47:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:50,859 INFO L471 AbstractCegarLoop]: Abstraction has 7245 states and 11391 transitions. [2025-03-08 15:47:50,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.307692307692307) internal successors, (290), 13 states have internal predecessors, (290), 5 states have call successors, (202), 2 states have call predecessors, (202), 4 states have return successors, (203), 4 states have call predecessors, (203), 5 states have call successors, (203) [2025-03-08 15:47:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7245 states and 11391 transitions. [2025-03-08 15:47:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-03-08 15:47:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:50,870 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:50,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:47:51,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 15:47:51,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:51,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash 357212360, now seen corresponding path program 1 times [2025-03-08 15:47:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388035281] [2025-03-08 15:47:51,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes.