./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ac9315a2690c53799e4a492753ac2b98281ab80b3a768a5d84279facf8e19983 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:20:06,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:20:06,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:20:06,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:20:06,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:20:06,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:20:06,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:20:06,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:20:06,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:20:06,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:20:06,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:20:06,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:20:06,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:20:06,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:20:06,417 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:20:06,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:20:06,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:20:06,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:20:06,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:20:06,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:20:06,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:20:06,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:20:06,420 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-jdk21/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 -> ac9315a2690c53799e4a492753ac2b98281ab80b3a768a5d84279facf8e19983 [2025-02-06 02:20:06,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:20:06,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:20:06,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:20:06,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:20:06,629 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:20:06,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i [2025-02-06 02:20:07,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcae5319a/76bf6bf94ef24544810d3e2beedd7f5d/FLAGc5832e224 [2025-02-06 02:20:08,132 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:20:08,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i [2025-02-06 02:20:08,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcae5319a/76bf6bf94ef24544810d3e2beedd7f5d/FLAGc5832e224 [2025-02-06 02:20:08,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcae5319a/76bf6bf94ef24544810d3e2beedd7f5d [2025-02-06 02:20:08,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:20:08,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:20:08,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:20:08,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:20:08,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:20:08,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334f722a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08, skipping insertion in model container [2025-02-06 02:20:08,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:20:08,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i[916,929] [2025-02-06 02:20:08,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:20:08,681 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:20:08,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i[916,929] [2025-02-06 02:20:08,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:20:08,786 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:20:08,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08 WrapperNode [2025-02-06 02:20:08,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:20:08,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:20:08,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:20:08,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:20:08,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,884 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2025-02-06 02:20:08,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:20:08,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:20:08,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:20:08,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:20:08,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,946 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-02-06 02:20:08,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:08,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:09,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:09,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:20:09,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:20:09,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:20:09,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:20:09,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (1/1) ... [2025-02-06 02:20:09,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:20:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:09,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:20:09,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:20:09,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:20:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:20:09,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:20:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:20:09,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:20:09,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:20:09,159 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:20:09,161 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:20:09,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise48#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short53#1;havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1; [2025-02-06 02:20:09,872 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-06 02:20:09,872 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:20:09,897 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:20:09,897 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:20:09,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:20:09 BoogieIcfgContainer [2025-02-06 02:20:09,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:20:09,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:20:09,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:20:09,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:20:09,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:20:08" (1/3) ... [2025-02-06 02:20:09,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faf0285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:20:09, skipping insertion in model container [2025-02-06 02:20:09,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:20:08" (2/3) ... [2025-02-06 02:20:09,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faf0285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:20:09, skipping insertion in model container [2025-02-06 02:20:09,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:20:09" (3/3) ... [2025-02-06 02:20:09,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-63.i [2025-02-06 02:20:09,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:20:09,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-63.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:20:09,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:20:09,976 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;@45144196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:20:09,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:20:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 186 states have internal predecessors, (277), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-06 02:20:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:20:10,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:10,030 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:10,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:10,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1471689869, now seen corresponding path program 1 times [2025-02-06 02:20:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020775387] [2025-02-06 02:20:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:10,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:20:10,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:20:10,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:10,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-02-06 02:20:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020775387] [2025-02-06 02:20:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020775387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:20:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035003620] [2025-02-06 02:20:10,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:10,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:20:10,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:20:10,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:20:10,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:20:10,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:20:10,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:20:10,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:10,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:10,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:20:10,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:20:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-02-06 02:20:10,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:20:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035003620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:10,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:20:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:20:10,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840592500] [2025-02-06 02:20:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:20:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:10,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:20:10,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:20:10,744 INFO L87 Difference]: Start difference. First operand has 235 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 186 states have internal predecessors, (277), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 02:20:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:10,807 INFO L93 Difference]: Finished difference Result 463 states and 782 transitions. [2025-02-06 02:20:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:20:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 325 [2025-02-06 02:20:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:10,815 INFO L225 Difference]: With dead ends: 463 [2025-02-06 02:20:10,817 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 02:20:10,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 326 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-02-06 02:20:10,824 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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-02-06 02:20:10,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:20:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 02:20:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-02-06 02:20:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 182 states have internal predecessors, (266), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-06 02:20:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2025-02-06 02:20:10,905 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 325 [2025-02-06 02:20:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:10,909 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2025-02-06 02:20:10,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 02:20:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2025-02-06 02:20:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:20:10,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:10,916 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:10,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:20:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:20:11,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 613416148, now seen corresponding path program 1 times [2025-02-06 02:20:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629869905] [2025-02-06 02:20:11,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:20:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:20:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629869905] [2025-02-06 02:20:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629869905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:20:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025254103] [2025-02-06 02:20:11,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:20:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:11,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:20:11,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:20:11,448 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:11,542 INFO L93 Difference]: Finished difference Result 568 states and 880 transitions. [2025-02-06 02:20:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:20:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-02-06 02:20:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:11,549 INFO L225 Difference]: With dead ends: 568 [2025-02-06 02:20:11,549 INFO L226 Difference]: Without dead ends: 340 [2025-02-06 02:20:11,552 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-02-06 02:20:11,552 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 186 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:11,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 729 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-06 02:20:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2025-02-06 02:20:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 279 states have (on average 1.4587813620071686) internal successors, (407), 280 states have internal predecessors, (407), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 02:20:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 517 transitions. [2025-02-06 02:20:11,619 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 517 transitions. Word has length 325 [2025-02-06 02:20:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:11,619 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 517 transitions. [2025-02-06 02:20:11,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 517 transitions. [2025-02-06 02:20:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:20:11,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:11,624 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:20:11,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 164719509, now seen corresponding path program 1 times [2025-02-06 02:20:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033370754] [2025-02-06 02:20:11,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:11,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:20:11,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:20:11,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:11,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033370754] [2025-02-06 02:20:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033370754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717140535] [2025-02-06 02:20:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:12,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:12,390 INFO L87 Difference]: Start difference. First operand 337 states and 517 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:12,646 INFO L93 Difference]: Finished difference Result 1111 states and 1687 transitions. [2025-02-06 02:20:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-02-06 02:20:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:12,656 INFO L225 Difference]: With dead ends: 1111 [2025-02-06 02:20:12,656 INFO L226 Difference]: Without dead ends: 777 [2025-02-06 02:20:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:20:12,658 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 362 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:12,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1068 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:20:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-06 02:20:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 588. [2025-02-06 02:20:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 516 states have (on average 1.4709302325581395) internal successors, (759), 519 states have internal predecessors, (759), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 02:20:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 893 transitions. [2025-02-06 02:20:12,701 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 893 transitions. Word has length 325 [2025-02-06 02:20:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 893 transitions. [2025-02-06 02:20:12,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 893 transitions. [2025-02-06 02:20:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-06 02:20:12,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:12,705 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:12,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:20:12,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:12,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2018957418, now seen corresponding path program 1 times [2025-02-06 02:20:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560936264] [2025-02-06 02:20:12,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-06 02:20:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-06 02:20:12,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:12,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560936264] [2025-02-06 02:20:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560936264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582962467] [2025-02-06 02:20:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:13,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:13,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:13,154 INFO L87 Difference]: Start difference. First operand 588 states and 893 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:13,322 INFO L93 Difference]: Finished difference Result 1355 states and 2045 transitions. [2025-02-06 02:20:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:13,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-02-06 02:20:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:13,328 INFO L225 Difference]: With dead ends: 1355 [2025-02-06 02:20:13,328 INFO L226 Difference]: Without dead ends: 770 [2025-02-06 02:20:13,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:13,329 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 291 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 993 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-06 02:20:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 520. [2025-02-06 02:20:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 463 states have (on average 1.4643628509719222) internal successors, (678), 464 states have internal predecessors, (678), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 02:20:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 784 transitions. [2025-02-06 02:20:13,348 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 784 transitions. Word has length 325 [2025-02-06 02:20:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:13,348 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 784 transitions. [2025-02-06 02:20:13,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 784 transitions. [2025-02-06 02:20:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:13,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:13,351 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:20:13,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1138192773, now seen corresponding path program 1 times [2025-02-06 02:20:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961147247] [2025-02-06 02:20:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:13,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:13,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:13,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961147247] [2025-02-06 02:20:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961147247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624114780] [2025-02-06 02:20:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:14,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:14,007 INFO L87 Difference]: Start difference. First operand 520 states and 784 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:14,147 INFO L93 Difference]: Finished difference Result 1457 states and 2181 transitions. [2025-02-06 02:20:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:14,152 INFO L225 Difference]: With dead ends: 1457 [2025-02-06 02:20:14,153 INFO L226 Difference]: Without dead ends: 938 [2025-02-06 02:20:14,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:14,155 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 642 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:14,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 869 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-02-06 02:20:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 545. [2025-02-06 02:20:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 494 states have (on average 1.4959514170040487) internal successors, (739), 494 states have internal predecessors, (739), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-06 02:20:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 833 transitions. [2025-02-06 02:20:14,190 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 833 transitions. Word has length 326 [2025-02-06 02:20:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:14,191 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 833 transitions. [2025-02-06 02:20:14,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 833 transitions. [2025-02-06 02:20:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:14,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:14,196 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:20:14,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash -787340538, now seen corresponding path program 1 times [2025-02-06 02:20:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531259155] [2025-02-06 02:20:14,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:14,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:14,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531259155] [2025-02-06 02:20:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531259155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:20:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407578726] [2025-02-06 02:20:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:20:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:14,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:20:14,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:20:14,322 INFO L87 Difference]: Start difference. First operand 545 states and 833 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:14,403 INFO L93 Difference]: Finished difference Result 1420 states and 2169 transitions. [2025-02-06 02:20:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:20:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:14,408 INFO L225 Difference]: With dead ends: 1420 [2025-02-06 02:20:14,408 INFO L226 Difference]: Without dead ends: 878 [2025-02-06 02:20:14,409 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-02-06 02:20:14,409 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 342 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:14,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 686 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-02-06 02:20:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 856. [2025-02-06 02:20:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 755 states have (on average 1.471523178807947) internal successors, (1111), 755 states have internal predecessors, (1111), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 02:20:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1299 transitions. [2025-02-06 02:20:14,451 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1299 transitions. Word has length 326 [2025-02-06 02:20:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:14,453 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1299 transitions. [2025-02-06 02:20:14,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1299 transitions. [2025-02-06 02:20:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:14,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:14,456 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:14,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:20:14,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1571966471, now seen corresponding path program 1 times [2025-02-06 02:20:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602756791] [2025-02-06 02:20:14,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:14,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:14,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:14,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:14,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:14,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602756791] [2025-02-06 02:20:14,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602756791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:14,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:14,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795960138] [2025-02-06 02:20:14,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:14,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:14,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:14,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:14,866 INFO L87 Difference]: Start difference. First operand 856 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:15,129 INFO L93 Difference]: Finished difference Result 2753 states and 4176 transitions. [2025-02-06 02:20:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:15,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:15,136 INFO L225 Difference]: With dead ends: 2753 [2025-02-06 02:20:15,136 INFO L226 Difference]: Without dead ends: 1900 [2025-02-06 02:20:15,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:20:15,138 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 475 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:15,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1188 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:20:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-02-06 02:20:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1762. [2025-02-06 02:20:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1611 states have (on average 1.489137181874612) internal successors, (2399), 1611 states have internal predecessors, (2399), 141 states have call successors, (141), 9 states have call predecessors, (141), 9 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-06 02:20:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2681 transitions. [2025-02-06 02:20:15,209 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2681 transitions. Word has length 326 [2025-02-06 02:20:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:15,210 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2681 transitions. [2025-02-06 02:20:15,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2681 transitions. [2025-02-06 02:20:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:15,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:15,238 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:15,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:20:15,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:15,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1176211334, now seen corresponding path program 1 times [2025-02-06 02:20:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:15,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726600801] [2025-02-06 02:20:15,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:15,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:15,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:15,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:15,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:15,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:15,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726600801] [2025-02-06 02:20:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726600801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124714749] [2025-02-06 02:20:15,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:15,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:15,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:15,618 INFO L87 Difference]: Start difference. First operand 1762 states and 2681 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:15,970 INFO L93 Difference]: Finished difference Result 4484 states and 6802 transitions. [2025-02-06 02:20:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:15,982 INFO L225 Difference]: With dead ends: 4484 [2025-02-06 02:20:15,982 INFO L226 Difference]: Without dead ends: 2725 [2025-02-06 02:20:15,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:20:15,986 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 250 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 986 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:20:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2025-02-06 02:20:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1931. [2025-02-06 02:20:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1730 states have (on average 1.4757225433526011) internal successors, (2553), 1730 states have internal predecessors, (2553), 188 states have call successors, (188), 12 states have call predecessors, (188), 12 states have return successors, (188), 188 states have call predecessors, (188), 188 states have call successors, (188) [2025-02-06 02:20:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2929 transitions. [2025-02-06 02:20:16,074 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2929 transitions. Word has length 326 [2025-02-06 02:20:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2929 transitions. [2025-02-06 02:20:16,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2929 transitions. [2025-02-06 02:20:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:16,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:16,080 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:20:16,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:16,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -524529145, now seen corresponding path program 1 times [2025-02-06 02:20:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603053982] [2025-02-06 02:20:16,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:16,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:16,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:16,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:16,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:16,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:16,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603053982] [2025-02-06 02:20:16,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603053982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:16,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:16,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:20:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820194116] [2025-02-06 02:20:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:16,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:20:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:16,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:20:16,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:20:16,641 INFO L87 Difference]: Start difference. First operand 1931 states and 2929 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:17,365 INFO L93 Difference]: Finished difference Result 4943 states and 7434 transitions. [2025-02-06 02:20:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:20:17,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:17,383 INFO L225 Difference]: With dead ends: 4943 [2025-02-06 02:20:17,383 INFO L226 Difference]: Without dead ends: 3184 [2025-02-06 02:20:17,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:20:17,387 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 850 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:17,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1380 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:20:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2025-02-06 02:20:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2630. [2025-02-06 02:20:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2329 states have (on average 1.4581365392872478) internal successors, (3396), 2329 states have internal predecessors, (3396), 282 states have call successors, (282), 18 states have call predecessors, (282), 18 states have return successors, (282), 282 states have call predecessors, (282), 282 states have call successors, (282) [2025-02-06 02:20:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3960 transitions. [2025-02-06 02:20:17,494 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3960 transitions. Word has length 326 [2025-02-06 02:20:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:17,494 INFO L471 AbstractCegarLoop]: Abstraction has 2630 states and 3960 transitions. [2025-02-06 02:20:17,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3960 transitions. [2025-02-06 02:20:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 02:20:17,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:17,499 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:17,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:20:17,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 197911225, now seen corresponding path program 1 times [2025-02-06 02:20:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200090065] [2025-02-06 02:20:17,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:17,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-02-06 02:20:17,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-02-06 02:20:17,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:17,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:21,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200090065] [2025-02-06 02:20:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200090065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:20:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841461477] [2025-02-06 02:20:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:21,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:20:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:20:21,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:20:21,975 INFO L87 Difference]: Start difference. First operand 2630 states and 3960 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:23,728 INFO L93 Difference]: Finished difference Result 9902 states and 14876 transitions. [2025-02-06 02:20:23,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:20:23,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-02-06 02:20:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:23,753 INFO L225 Difference]: With dead ends: 9902 [2025-02-06 02:20:23,753 INFO L226 Difference]: Without dead ends: 7444 [2025-02-06 02:20:23,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:20:23,759 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 1046 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:23,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1963 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:20:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2025-02-06 02:20:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 4349. [2025-02-06 02:20:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4349 states, 3793 states have (on average 1.4368573688373318) internal successors, (5450), 3793 states have internal predecessors, (5450), 517 states have call successors, (517), 38 states have call predecessors, (517), 38 states have return successors, (517), 517 states have call predecessors, (517), 517 states have call successors, (517) [2025-02-06 02:20:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 6484 transitions. [2025-02-06 02:20:23,968 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 6484 transitions. Word has length 326 [2025-02-06 02:20:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:23,968 INFO L471 AbstractCegarLoop]: Abstraction has 4349 states and 6484 transitions. [2025-02-06 02:20:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 6484 transitions. [2025-02-06 02:20:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:20:23,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:23,972 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:23,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:20:23,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:23,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1817690528, now seen corresponding path program 1 times [2025-02-06 02:20:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:23,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308585904] [2025-02-06 02:20:23,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:23,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:24,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308585904] [2025-02-06 02:20:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308585904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:20:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379049997] [2025-02-06 02:20:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:20:24,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:24,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:20:24,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:24,298 INFO L87 Difference]: Start difference. First operand 4349 states and 6484 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:24,497 INFO L93 Difference]: Finished difference Result 7600 states and 11348 transitions. [2025-02-06 02:20:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:20:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 327 [2025-02-06 02:20:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:24,524 INFO L225 Difference]: With dead ends: 7600 [2025-02-06 02:20:24,524 INFO L226 Difference]: Without dead ends: 5127 [2025-02-06 02:20:24,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:20:24,532 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 506 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:24,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 835 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:20:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2025-02-06 02:20:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4369. [2025-02-06 02:20:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 3813 states have (on average 1.4366640440597955) internal successors, (5478), 3813 states have internal predecessors, (5478), 517 states have call successors, (517), 38 states have call predecessors, (517), 38 states have return successors, (517), 517 states have call predecessors, (517), 517 states have call successors, (517) [2025-02-06 02:20:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6512 transitions. [2025-02-06 02:20:24,744 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6512 transitions. Word has length 327 [2025-02-06 02:20:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6512 transitions. [2025-02-06 02:20:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6512 transitions. [2025-02-06 02:20:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-06 02:20:24,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:24,747 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:24,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:20:24,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 647813503, now seen corresponding path program 1 times [2025-02-06 02:20:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584182992] [2025-02-06 02:20:24,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:24,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-06 02:20:24,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-06 02:20:24,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:24,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:28,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584182992] [2025-02-06 02:20:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584182992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:20:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394213837] [2025-02-06 02:20:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:20:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:20:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:20:28,227 INFO L87 Difference]: Start difference. First operand 4369 states and 6512 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:30,076 INFO L93 Difference]: Finished difference Result 8693 states and 12922 transitions. [2025-02-06 02:20:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:20:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 327 [2025-02-06 02:20:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:30,092 INFO L225 Difference]: With dead ends: 8693 [2025-02-06 02:20:30,093 INFO L226 Difference]: Without dead ends: 6215 [2025-02-06 02:20:30,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:20:30,099 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1007 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:30,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1930 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:20:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2025-02-06 02:20:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 4686. [2025-02-06 02:20:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 4130 states have (on average 1.4479418886198547) internal successors, (5980), 4130 states have internal predecessors, (5980), 517 states have call successors, (517), 38 states have call predecessors, (517), 38 states have return successors, (517), 517 states have call predecessors, (517), 517 states have call successors, (517) [2025-02-06 02:20:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 7014 transitions. [2025-02-06 02:20:30,251 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 7014 transitions. Word has length 327 [2025-02-06 02:20:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:30,252 INFO L471 AbstractCegarLoop]: Abstraction has 4686 states and 7014 transitions. [2025-02-06 02:20:30,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 7014 transitions. [2025-02-06 02:20:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:20:30,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:30,255 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:30,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:20:30,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:30,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash -343112787, now seen corresponding path program 1 times [2025-02-06 02:20:30,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:30,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998801855] [2025-02-06 02:20:30,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:30,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:20:30,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:20:30,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:30,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998801855] [2025-02-06 02:20:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998801855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:20:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116161734] [2025-02-06 02:20:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:31,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:20:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:31,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:20:31,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:20:31,435 INFO L87 Difference]: Start difference. First operand 4686 states and 7014 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:32,531 INFO L93 Difference]: Finished difference Result 12877 states and 18944 transitions. [2025-02-06 02:20:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 02:20:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 328 [2025-02-06 02:20:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:32,552 INFO L225 Difference]: With dead ends: 12877 [2025-02-06 02:20:32,553 INFO L226 Difference]: Without dead ends: 8670 [2025-02-06 02:20:32,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:20:32,562 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1502 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 2354 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:32,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 2354 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:20:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2025-02-06 02:20:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 7683. [2025-02-06 02:20:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 6972 states have (on average 1.4411933448078027) internal successors, (10048), 6987 states have internal predecessors, (10048), 627 states have call successors, (627), 83 states have call predecessors, (627), 83 states have return successors, (627), 612 states have call predecessors, (627), 627 states have call successors, (627) [2025-02-06 02:20:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 11302 transitions. [2025-02-06 02:20:32,810 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 11302 transitions. Word has length 328 [2025-02-06 02:20:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:32,810 INFO L471 AbstractCegarLoop]: Abstraction has 7683 states and 11302 transitions. [2025-02-06 02:20:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 11302 transitions. [2025-02-06 02:20:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:20:32,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:32,817 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:20:32,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 682379212, now seen corresponding path program 1 times [2025-02-06 02:20:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742466327] [2025-02-06 02:20:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:32,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:20:32,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:20:32,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:32,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742466327] [2025-02-06 02:20:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742466327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:20:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466394756] [2025-02-06 02:20:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:20:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:33,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:20:33,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:20:33,333 INFO L87 Difference]: Start difference. First operand 7683 states and 11302 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 02:20:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:33,911 INFO L93 Difference]: Finished difference Result 21799 states and 32064 transitions. [2025-02-06 02:20:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:20:33,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 328 [2025-02-06 02:20:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:33,987 INFO L225 Difference]: With dead ends: 21799 [2025-02-06 02:20:33,991 INFO L226 Difference]: Without dead ends: 14861 [2025-02-06 02:20:34,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:20:34,009 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 920 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:34,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1769 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:20:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14861 states. [2025-02-06 02:20:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14861 to 13374. [2025-02-06 02:20:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13374 states, 12663 states have (on average 1.4567638000473822) internal successors, (18447), 12678 states have internal predecessors, (18447), 627 states have call successors, (627), 83 states have call predecessors, (627), 83 states have return successors, (627), 612 states have call predecessors, (627), 627 states have call successors, (627) [2025-02-06 02:20:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13374 states to 13374 states and 19701 transitions. [2025-02-06 02:20:34,571 INFO L78 Accepts]: Start accepts. Automaton has 13374 states and 19701 transitions. Word has length 328 [2025-02-06 02:20:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:34,572 INFO L471 AbstractCegarLoop]: Abstraction has 13374 states and 19701 transitions. [2025-02-06 02:20:34,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-02-06 02:20:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13374 states and 19701 transitions. [2025-02-06 02:20:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-06 02:20:34,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:34,585 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:20:34,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash 37499671, now seen corresponding path program 1 times [2025-02-06 02:20:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:34,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065207702] [2025-02-06 02:20:34,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:34,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-06 02:20:34,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-06 02:20:34,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:20:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-02-06 02:20:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:20:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065207702] [2025-02-06 02:20:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065207702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:20:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:20:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 02:20:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919032807] [2025-02-06 02:20:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:20:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:20:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:20:35,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:20:35,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:20:35,513 INFO L87 Difference]: Start difference. First operand 13374 states and 19701 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:20:35,940 INFO L93 Difference]: Finished difference Result 21945 states and 32266 transitions. [2025-02-06 02:20:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:20:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 328 [2025-02-06 02:20:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:20:35,969 INFO L225 Difference]: With dead ends: 21945 [2025-02-06 02:20:35,969 INFO L226 Difference]: Without dead ends: 14279 [2025-02-06 02:20:35,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:20:35,983 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 176 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:20:35,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1750 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:20:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14279 states. [2025-02-06 02:20:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14279 to 14271. [2025-02-06 02:20:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14271 states, 13519 states have (on average 1.4450033286485686) internal successors, (19535), 13540 states have internal predecessors, (19535), 651 states have call successors, (651), 100 states have call predecessors, (651), 100 states have return successors, (651), 630 states have call predecessors, (651), 651 states have call successors, (651) [2025-02-06 02:20:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14271 states to 14271 states and 20837 transitions. [2025-02-06 02:20:36,392 INFO L78 Accepts]: Start accepts. Automaton has 14271 states and 20837 transitions. Word has length 328 [2025-02-06 02:20:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:20:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 14271 states and 20837 transitions. [2025-02-06 02:20:36,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-02-06 02:20:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14271 states and 20837 transitions. [2025-02-06 02:20:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 02:20:36,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:20:36,417 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:20:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:20:36,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:20:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:20:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash 983072192, now seen corresponding path program 1 times [2025-02-06 02:20:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:20:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751832142] [2025-02-06 02:20:36,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:20:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:20:36,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 02:20:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 02:20:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:20:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat