./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-18.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 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:21:08,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:21:08,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:21:08,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:21:08,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:21:08,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:21:08,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:21:08,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:21:08,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:21:08,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:21:08,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:21:08,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:21:08,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:21:08,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:21:08,482 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:21:08,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:21:08,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:21:08,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:21:08,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:21:08,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:21:08,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:08,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:21:08,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:08,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:21:08,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:21:08,486 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 -> 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 [2025-01-09 14:21:08,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:21:08,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:21:08,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:21:08,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:21:08,720 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:21:08,720 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-18.i [2025-01-09 14:21:09,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/626733d4e/2b97bcfcc47343f8b1326e37c6a2e400/FLAG6be932da6 [2025-01-09 14:21:10,153 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:21:10,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i [2025-01-09 14:21:10,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/626733d4e/2b97bcfcc47343f8b1326e37c6a2e400/FLAG6be932da6 [2025-01-09 14:21:10,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/626733d4e/2b97bcfcc47343f8b1326e37c6a2e400 [2025-01-09 14:21:10,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:21:10,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:21:10,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:10,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:21:10,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:21:10,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10, skipping insertion in model container [2025-01-09 14:21:10,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:21:10,591 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-18.i[916,929] [2025-01-09 14:21:10,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:10,717 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:21:10,723 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-18.i[916,929] [2025-01-09 14:21:10,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:10,788 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:21:10,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10 WrapperNode [2025-01-09 14:21:10,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:10,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:10,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:21:10,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:21:10,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,846 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-01-09 14:21:10,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:10,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:21:10,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:21:10,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:21:10,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,892 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-01-09 14:21:10,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:21:10,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:21:10,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:21:10,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:21:10,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (1/1) ... [2025-01-09 14:21:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:10,991 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-01-09 14:21:10,998 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-01-09 14:21:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:21:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:21:11,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:21:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:21:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:21:11,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:21:11,112 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:21:11,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:21:11,835 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-01-09 14:21:11,835 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:21:11,845 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:21:11,847 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:21:11,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:11 BoogieIcfgContainer [2025-01-09 14:21:11,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:21:11,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:21:11,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:21:11,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:21:11,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:21:10" (1/3) ... [2025-01-09 14:21:11,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f7a7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:11, skipping insertion in model container [2025-01-09 14:21:11,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:10" (2/3) ... [2025-01-09 14:21:11,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f7a7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:11, skipping insertion in model container [2025-01-09 14:21:11,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:11" (3/3) ... [2025-01-09 14:21:11,856 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-18.i [2025-01-09 14:21:11,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:21:11,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-18.i that has 2 procedures, 202 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:21:11,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:21:11,936 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;@4250c15a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:21:11,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:21:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 149 states have internal predecessors, (227), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 14:21:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:11,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:11,958 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:11,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:11,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1943434668, now seen corresponding path program 1 times [2025-01-09 14:21:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028236067] [2025-01-09 14:21:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:12,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:12,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:12,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:12,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-01-09 14:21:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028236067] [2025-01-09 14:21:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028236067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:12,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594974874] [2025-01-09 14:21:12,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:12,387 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-01-09 14:21:12,389 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-01-09 14:21:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:12,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:12,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:12,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:21:12,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-01-09 14:21:12,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:21:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594974874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:21:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:21:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035026955] [2025-01-09 14:21:12,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:12,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:21:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:12,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:21:12,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:21:12,662 INFO L87 Difference]: Start difference. First operand has 202 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 149 states have internal predecessors, (227), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:12,693 INFO L93 Difference]: Finished difference Result 398 states and 704 transitions. [2025-01-09 14:21:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:21:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 342 [2025-01-09 14:21:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:12,704 INFO L225 Difference]: With dead ends: 398 [2025-01-09 14:21:12,705 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 14:21:12,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 343 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-01-09 14:21:12,710 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:12,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 14:21:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-01-09 14:21:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 146 states have (on average 1.5068493150684932) internal successors, (220), 146 states have internal predecessors, (220), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 14:21:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 322 transitions. [2025-01-09 14:21:12,749 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 322 transitions. Word has length 342 [2025-01-09 14:21:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:12,750 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 322 transitions. [2025-01-09 14:21:12,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 322 transitions. [2025-01-09 14:21:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:12,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:12,756 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:12,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:21:12,960 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-01-09 14:21:12,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:12,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -416256806, now seen corresponding path program 1 times [2025-01-09 14:21:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479507339] [2025-01-09 14:21:12,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:13,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:13,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:13,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479507339] [2025-01-09 14:21:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479507339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955537615] [2025-01-09 14:21:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:13,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:13,305 INFO L87 Difference]: Start difference. First operand 199 states and 322 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:13,430 INFO L93 Difference]: Finished difference Result 585 states and 950 transitions. [2025-01-09 14:21:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-01-09 14:21:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:13,439 INFO L225 Difference]: With dead ends: 585 [2025-01-09 14:21:13,440 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 14:21:13,441 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-01-09 14:21:13,446 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 282 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:13,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 670 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 14:21:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2025-01-09 14:21:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 280 states have (on average 1.4892857142857143) internal successors, (417), 280 states have internal predecessors, (417), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:21:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 621 transitions. [2025-01-09 14:21:13,516 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 621 transitions. Word has length 342 [2025-01-09 14:21:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 621 transitions. [2025-01-09 14:21:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 621 transitions. [2025-01-09 14:21:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:13,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:13,525 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:21:13,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1013432150, now seen corresponding path program 1 times [2025-01-09 14:21:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761853160] [2025-01-09 14:21:13,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:13,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:13,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:13,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761853160] [2025-01-09 14:21:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761853160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558631856] [2025-01-09 14:21:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:13,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:13,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:13,779 INFO L87 Difference]: Start difference. First operand 385 states and 621 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:13,894 INFO L93 Difference]: Finished difference Result 1143 states and 1845 transitions. [2025-01-09 14:21:13,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:13,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-01-09 14:21:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:13,902 INFO L225 Difference]: With dead ends: 1143 [2025-01-09 14:21:13,903 INFO L226 Difference]: Without dead ends: 761 [2025-01-09 14:21:13,905 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-01-09 14:21:13,906 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 311 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:13,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 935 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-01-09 14:21:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 387. [2025-01-09 14:21:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 282 states have (on average 1.4858156028368794) internal successors, (419), 282 states have internal predecessors, (419), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:21:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 623 transitions. [2025-01-09 14:21:13,967 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 623 transitions. Word has length 342 [2025-01-09 14:21:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 623 transitions. [2025-01-09 14:21:13,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 623 transitions. [2025-01-09 14:21:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-09 14:21:13,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:13,973 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:21:13,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -431636394, now seen corresponding path program 1 times [2025-01-09 14:21:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381498696] [2025-01-09 14:21:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:14,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-09 14:21:14,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-09 14:21:14,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:14,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381498696] [2025-01-09 14:21:14,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381498696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:14,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:21:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310253976] [2025-01-09 14:21:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:21:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:14,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:21:14,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:21:14,368 INFO L87 Difference]: Start difference. First operand 387 states and 623 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-01-09 14:21:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:14,432 INFO L93 Difference]: Finished difference Result 771 states and 1243 transitions. [2025-01-09 14:21:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 342 [2025-01-09 14:21:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:14,440 INFO L225 Difference]: With dead ends: 771 [2025-01-09 14:21:14,441 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 14:21:14,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:21:14,444 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:14,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 310 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 14:21:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2025-01-09 14:21:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 280 states have (on average 1.4821428571428572) internal successors, (415), 280 states have internal predecessors, (415), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 14:21:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 619 transitions. [2025-01-09 14:21:14,483 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 619 transitions. Word has length 342 [2025-01-09 14:21:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 619 transitions. [2025-01-09 14:21:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-01-09 14:21:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 619 transitions. [2025-01-09 14:21:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:14,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:14,491 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:14,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:21:14,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:14,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -104101315, now seen corresponding path program 1 times [2025-01-09 14:21:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902621676] [2025-01-09 14:21:14,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:14,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:14,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:14,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:14,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902621676] [2025-01-09 14:21:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902621676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:21:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873861138] [2025-01-09 14:21:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:21:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:15,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:21:15,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:21:15,886 INFO L87 Difference]: Start difference. First operand 385 states and 619 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:17,418 INFO L93 Difference]: Finished difference Result 1417 states and 2271 transitions. [2025-01-09 14:21:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:21:17,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 343 [2025-01-09 14:21:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:17,424 INFO L225 Difference]: With dead ends: 1417 [2025-01-09 14:21:17,424 INFO L226 Difference]: Without dead ends: 1035 [2025-01-09 14:21:17,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:21:17,426 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1503 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:17,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1698 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:21:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-01-09 14:21:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 506. [2025-01-09 14:21:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 349 states have (on average 1.4555873925501432) internal successors, (508), 349 states have internal predecessors, (508), 153 states have call successors, (153), 3 states have call predecessors, (153), 3 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-09 14:21:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 814 transitions. [2025-01-09 14:21:17,476 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 814 transitions. Word has length 343 [2025-01-09 14:21:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:17,477 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 814 transitions. [2025-01-09 14:21:17,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-01-09 14:21:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 814 transitions. [2025-01-09 14:21:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:17,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:17,484 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:21:17,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:17,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1949468481, now seen corresponding path program 1 times [2025-01-09 14:21:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756220672] [2025-01-09 14:21:17,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:17,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:17,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:17,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756220672] [2025-01-09 14:21:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756220672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722229663] [2025-01-09 14:21:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:18,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:18,481 INFO L87 Difference]: Start difference. First operand 506 states and 814 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:18,880 INFO L93 Difference]: Finished difference Result 1388 states and 2185 transitions. [2025-01-09 14:21:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:18,887 INFO L225 Difference]: With dead ends: 1388 [2025-01-09 14:21:18,887 INFO L226 Difference]: Without dead ends: 1006 [2025-01-09 14:21:18,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:18,889 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 439 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1013 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1013 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:21:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-01-09 14:21:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 736. [2025-01-09 14:21:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 549 states have (on average 1.4790528233151183) internal successors, (812), 551 states have internal predecessors, (812), 181 states have call successors, (181), 5 states have call predecessors, (181), 5 states have return successors, (181), 179 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 14:21:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1174 transitions. [2025-01-09 14:21:18,951 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1174 transitions. Word has length 343 [2025-01-09 14:21:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:18,951 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1174 transitions. [2025-01-09 14:21:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1174 transitions. [2025-01-09 14:21:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:18,956 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:21:18,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:18,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1324430461, now seen corresponding path program 1 times [2025-01-09 14:21:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116343681] [2025-01-09 14:21:18,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:18,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:18,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:19,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:19,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:19,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:19,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116343681] [2025-01-09 14:21:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116343681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:19,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320010565] [2025-01-09 14:21:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:19,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:19,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:19,728 INFO L87 Difference]: Start difference. First operand 736 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:20,085 INFO L93 Difference]: Finished difference Result 2171 states and 3425 transitions. [2025-01-09 14:21:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:20,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:20,096 INFO L225 Difference]: With dead ends: 2171 [2025-01-09 14:21:20,096 INFO L226 Difference]: Without dead ends: 1553 [2025-01-09 14:21:20,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:20,098 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 812 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:20,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 994 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:21:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-01-09 14:21:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 943. [2025-01-09 14:21:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 755 states have (on average 1.5218543046357615) internal successors, (1149), 757 states have internal predecessors, (1149), 181 states have call successors, (181), 6 states have call predecessors, (181), 6 states have return successors, (181), 179 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 14:21:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1511 transitions. [2025-01-09 14:21:20,181 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1511 transitions. Word has length 343 [2025-01-09 14:21:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1511 transitions. [2025-01-09 14:21:20,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1511 transitions. [2025-01-09 14:21:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:20,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:20,187 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:20,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:21:20,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 498046911, now seen corresponding path program 1 times [2025-01-09 14:21:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799187763] [2025-01-09 14:21:20,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:20,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:20,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:20,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799187763] [2025-01-09 14:21:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799187763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294928074] [2025-01-09 14:21:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:34,784 INFO L87 Difference]: Start difference. First operand 943 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:35,445 INFO L93 Difference]: Finished difference Result 2697 states and 4284 transitions. [2025-01-09 14:21:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:35,454 INFO L225 Difference]: With dead ends: 2697 [2025-01-09 14:21:35,454 INFO L226 Difference]: Without dead ends: 1903 [2025-01-09 14:21:35,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:21:35,456 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 378 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:35,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1146 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:21:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-01-09 14:21:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1129. [2025-01-09 14:21:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 929 states have (on average 1.497308934337998) internal successors, (1391), 935 states have internal predecessors, (1391), 189 states have call successors, (189), 10 states have call predecessors, (189), 10 states have return successors, (189), 183 states have call predecessors, (189), 189 states have call successors, (189) [2025-01-09 14:21:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1769 transitions. [2025-01-09 14:21:35,540 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1769 transitions. Word has length 343 [2025-01-09 14:21:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:35,541 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1769 transitions. [2025-01-09 14:21:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1769 transitions. [2025-01-09 14:21:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:35,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:35,548 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:21:35,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:35,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1527850365, now seen corresponding path program 1 times [2025-01-09 14:21:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117848245] [2025-01-09 14:21:35,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:35,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:35,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:35,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:35,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117848245] [2025-01-09 14:21:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117848245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:35,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:35,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:21:35,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071490814] [2025-01-09 14:21:35,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:35,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:21:35,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:35,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:21:35,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:21:35,986 INFO L87 Difference]: Start difference. First operand 1129 states and 1769 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:36,148 INFO L93 Difference]: Finished difference Result 3091 states and 4742 transitions. [2025-01-09 14:21:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:21:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:36,157 INFO L225 Difference]: With dead ends: 3091 [2025-01-09 14:21:36,157 INFO L226 Difference]: Without dead ends: 2111 [2025-01-09 14:21:36,159 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-01-09 14:21:36,160 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 226 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:36,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 852 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2025-01-09 14:21:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1673. [2025-01-09 14:21:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1397 states have (on average 1.4695776664280602) internal successors, (2053), 1411 states have internal predecessors, (2053), 257 states have call successors, (257), 18 states have call predecessors, (257), 18 states have return successors, (257), 243 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 14:21:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2567 transitions. [2025-01-09 14:21:36,248 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2567 transitions. Word has length 343 [2025-01-09 14:21:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:36,248 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2567 transitions. [2025-01-09 14:21:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2567 transitions. [2025-01-09 14:21:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:36,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:36,252 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:36,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:21:36,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:36,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1001494593, now seen corresponding path program 1 times [2025-01-09 14:21:36,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:36,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3150184] [2025-01-09 14:21:36,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:36,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:36,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3150184] [2025-01-09 14:21:36,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3150184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:36,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:36,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190277871] [2025-01-09 14:21:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:36,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:36,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:36,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:36,572 INFO L87 Difference]: Start difference. First operand 1673 states and 2567 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:36,673 INFO L93 Difference]: Finished difference Result 4134 states and 6369 transitions. [2025-01-09 14:21:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:36,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:36,685 INFO L225 Difference]: With dead ends: 4134 [2025-01-09 14:21:36,685 INFO L226 Difference]: Without dead ends: 2610 [2025-01-09 14:21:36,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 14:21:36,689 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 195 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:36,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 722 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2025-01-09 14:21:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2608. [2025-01-09 14:21:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2134 states have (on average 1.465323336457357) internal successors, (3127), 2154 states have internal predecessors, (3127), 447 states have call successors, (447), 26 states have call predecessors, (447), 26 states have return successors, (447), 427 states have call predecessors, (447), 447 states have call successors, (447) [2025-01-09 14:21:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 4021 transitions. [2025-01-09 14:21:36,825 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 4021 transitions. Word has length 343 [2025-01-09 14:21:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 4021 transitions. [2025-01-09 14:21:36,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 4021 transitions. [2025-01-09 14:21:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:36,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:36,829 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:36,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:21:36,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2022562947, now seen corresponding path program 1 times [2025-01-09 14:21:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305611737] [2025-01-09 14:21:36,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:36,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:36,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:36,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305611737] [2025-01-09 14:21:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305611737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689164516] [2025-01-09 14:21:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:37,372 INFO L87 Difference]: Start difference. First operand 2608 states and 4021 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:37,877 INFO L93 Difference]: Finished difference Result 6815 states and 10351 transitions. [2025-01-09 14:21:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:37,897 INFO L225 Difference]: With dead ends: 6815 [2025-01-09 14:21:37,897 INFO L226 Difference]: Without dead ends: 4356 [2025-01-09 14:21:37,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:21:37,904 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 675 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:37,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1139 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:21:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2025-01-09 14:21:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 2756. [2025-01-09 14:21:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2282 states have (on average 1.471954425942156) internal successors, (3359), 2302 states have internal predecessors, (3359), 447 states have call successors, (447), 26 states have call predecessors, (447), 26 states have return successors, (447), 427 states have call predecessors, (447), 447 states have call successors, (447) [2025-01-09 14:21:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4253 transitions. [2025-01-09 14:21:38,050 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4253 transitions. Word has length 343 [2025-01-09 14:21:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:38,051 INFO L471 AbstractCegarLoop]: Abstraction has 2756 states and 4253 transitions. [2025-01-09 14:21:38,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4253 transitions. [2025-01-09 14:21:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:38,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:38,055 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:21:38,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1569192261, now seen corresponding path program 1 times [2025-01-09 14:21:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374710904] [2025-01-09 14:21:38,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:38,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374710904] [2025-01-09 14:21:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374710904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:47,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:21:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673495150] [2025-01-09 14:21:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:47,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:21:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:47,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:21:47,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:21:47,379 INFO L87 Difference]: Start difference. First operand 2756 states and 4253 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:47,868 INFO L93 Difference]: Finished difference Result 8189 states and 12444 transitions. [2025-01-09 14:21:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:21:47,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:47,887 INFO L225 Difference]: With dead ends: 8189 [2025-01-09 14:21:47,887 INFO L226 Difference]: Without dead ends: 5586 [2025-01-09 14:21:47,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:21:47,894 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 280 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:47,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2089 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:21:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2025-01-09 14:21:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 4201. [2025-01-09 14:21:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4201 states, 3703 states have (on average 1.5114771806643261) internal successors, (5597), 3731 states have internal predecessors, (5597), 463 states have call successors, (463), 34 states have call predecessors, (463), 34 states have return successors, (463), 435 states have call predecessors, (463), 463 states have call successors, (463) [2025-01-09 14:21:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6523 transitions. [2025-01-09 14:21:48,048 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6523 transitions. Word has length 343 [2025-01-09 14:21:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:48,049 INFO L471 AbstractCegarLoop]: Abstraction has 4201 states and 6523 transitions. [2025-01-09 14:21:48,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6523 transitions. [2025-01-09 14:21:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:48,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:48,059 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:21:48,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 705866497, now seen corresponding path program 1 times [2025-01-09 14:21:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157881592] [2025-01-09 14:21:48,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:48,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:48,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:48,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:48,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:21:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157881592] [2025-01-09 14:21:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157881592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:21:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346728204] [2025-01-09 14:21:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:21:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:48,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:21:48,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:21:48,567 INFO L87 Difference]: Start difference. First operand 4201 states and 6523 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:49,462 INFO L93 Difference]: Finished difference Result 19520 states and 30169 transitions. [2025-01-09 14:21:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:21:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:21:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:49,506 INFO L225 Difference]: With dead ends: 19520 [2025-01-09 14:21:49,506 INFO L226 Difference]: Without dead ends: 15528 [2025-01-09 14:21:49,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:21:49,516 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 686 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:49,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1325 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:21:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15528 states. [2025-01-09 14:21:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15528 to 10392. [2025-01-09 14:21:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10392 states, 9450 states have (on average 1.5168253968253969) internal successors, (14334), 9506 states have internal predecessors, (14334), 875 states have call successors, (875), 66 states have call predecessors, (875), 66 states have return successors, (875), 819 states have call predecessors, (875), 875 states have call successors, (875) [2025-01-09 14:21:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10392 states to 10392 states and 16084 transitions. [2025-01-09 14:21:49,887 INFO L78 Accepts]: Start accepts. Automaton has 10392 states and 16084 transitions. Word has length 343 [2025-01-09 14:21:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:49,889 INFO L471 AbstractCegarLoop]: Abstraction has 10392 states and 16084 transitions. [2025-01-09 14:21:49,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:21:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10392 states and 16084 transitions. [2025-01-09 14:21:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:21:49,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:49,899 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:21:49,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:21:49,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1288278209, now seen corresponding path program 1 times [2025-01-09 14:21:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135073553] [2025-01-09 14:21:49,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:49,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:21:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:21:50,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-01-09 14:22:02,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135073553] [2025-01-09 14:22:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135073553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:02,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:22:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796287805] [2025-01-09 14:22:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:22:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:02,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:22:02,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:02,727 INFO L87 Difference]: Start difference. First operand 10392 states and 16084 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:22:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:04,023 INFO L93 Difference]: Finished difference Result 31678 states and 48797 transitions. [2025-01-09 14:22:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:22:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-01-09 14:22:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:04,070 INFO L225 Difference]: With dead ends: 31678 [2025-01-09 14:22:04,070 INFO L226 Difference]: Without dead ends: 21495 [2025-01-09 14:22:04,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:04,082 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 369 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:04,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1634 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:22:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21495 states. [2025-01-09 14:22:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21495 to 10720. [2025-01-09 14:22:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10720 states, 9778 states have (on average 1.5138065043976274) internal successors, (14802), 9834 states have internal predecessors, (14802), 875 states have call successors, (875), 66 states have call predecessors, (875), 66 states have return successors, (875), 819 states have call predecessors, (875), 875 states have call successors, (875) [2025-01-09 14:22:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 16552 transitions. [2025-01-09 14:22:04,600 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 16552 transitions. Word has length 343 [2025-01-09 14:22:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:04,603 INFO L471 AbstractCegarLoop]: Abstraction has 10720 states and 16552 transitions. [2025-01-09 14:22:04,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-01-09 14:22:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 16552 transitions. [2025-01-09 14:22:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-09 14:22:04,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:04,615 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:22:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:22:04,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 980626111, now seen corresponding path program 1 times [2025-01-09 14:22:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567965430] [2025-01-09 14:22:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:04,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-09 14:22:05,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-09 14:22:05,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:05,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:30,525 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 226 DAG size of output: 218 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)