./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-59.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_amount500_file-59.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 53736bb88727ad83b896da53b027ab46627954d43b2b2b706fd99df8b1ab872f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:48:28,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:48:28,436 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:48:28,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:48:28,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:48:28,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:48:28,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:48:28,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:48:28,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:48:28,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:48:28,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:48:28,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:48:28,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:48:28,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:48:28,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:28,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:28,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:28,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:48:28,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:48:28,455 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 -> 53736bb88727ad83b896da53b027ab46627954d43b2b2b706fd99df8b1ab872f [2025-01-09 14:48:28,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:48:28,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:48:28,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:48:28,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:48:28,633 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:48:28,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-59.i [2025-01-09 14:48:29,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/735cbdf9a/8d7e662af57847b1b73b92383d2d5c48/FLAG8785dbd5c [2025-01-09 14:48:30,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:48:30,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-59.i [2025-01-09 14:48:30,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/735cbdf9a/8d7e662af57847b1b73b92383d2d5c48/FLAG8785dbd5c [2025-01-09 14:48:30,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/735cbdf9a/8d7e662af57847b1b73b92383d2d5c48 [2025-01-09 14:48:30,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:48:30,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:48:30,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:30,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:48:30,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:48:30,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:30,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745f2a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30, skipping insertion in model container [2025-01-09 14:48:30,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:30,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:48:30,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-59.i[916,929] [2025-01-09 14:48:30,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:30,757 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:48:30,764 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_amount500_file-59.i[916,929] [2025-01-09 14:48:30,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:30,886 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:48:30,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30 WrapperNode [2025-01-09 14:48:30,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:30,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:30,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:48:30,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:48:30,893 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:48:30" (1/1) ... [2025-01-09 14:48:30,909 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:48:30" (1/1) ... [2025-01-09 14:48:30,972 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 843 [2025-01-09 14:48:30,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:30,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:48:30,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:48:30,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:48:30,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:30,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,094 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:48:31,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:48:31,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:48:31,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:48:31,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:48:31,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (1/1) ... [2025-01-09 14:48:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:31,192 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:48:31,199 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:48:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:48:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:48:31,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:48:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:48:31,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:48:31,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:48:31,346 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:48:31,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:48:32,365 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-01-09 14:48:32,365 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:48:32,376 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:48:32,376 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:48:32,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:32 BoogieIcfgContainer [2025-01-09 14:48:32,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:48:32,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:48:32,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:48:32,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:48:32,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:30" (1/3) ... [2025-01-09 14:48:32,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d36fa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:32, skipping insertion in model container [2025-01-09 14:48:32,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:30" (2/3) ... [2025-01-09 14:48:32,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d36fa23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:32, skipping insertion in model container [2025-01-09 14:48:32,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:32" (3/3) ... [2025-01-09 14:48:32,383 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-59.i [2025-01-09 14:48:32,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:48:32,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-59.i that has 2 procedures, 324 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:48:32,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:48:32,435 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;@27daedb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:48:32,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:48:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 261 states have (on average 1.5478927203065134) internal successors, (404), 262 states have internal predecessors, (404), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:48:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:48:32,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:32,451 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:32,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1025614346, now seen corresponding path program 1 times [2025-01-09 14:48:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043569650] [2025-01-09 14:48:32,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:48:32,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:48:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:48:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043569650] [2025-01-09 14:48:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043569650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723845488] [2025-01-09 14:48:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:33,030 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:48:33,033 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:48:33,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:48:33,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:48:33,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:33,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:48:33,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:48:33,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:48:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723845488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:48:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:48:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400107168] [2025-01-09 14:48:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:48:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:33,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:48:33,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:48:33,457 INFO L87 Difference]: Start difference. First operand has 324 states, 261 states have (on average 1.5478927203065134) internal successors, (404), 262 states have internal predecessors, (404), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:48:33,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:33,502 INFO L93 Difference]: Finished difference Result 641 states and 1101 transitions. [2025-01-09 14:48:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:48:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 438 [2025-01-09 14:48:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:33,509 INFO L225 Difference]: With dead ends: 641 [2025-01-09 14:48:33,509 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 14:48:33,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 439 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:48:33,514 INFO L435 NwaCegarLoop]: 516 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, 516 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:48:33,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 14:48:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-01-09 14:48:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 258 states have (on average 1.5348837209302326) internal successors, (396), 258 states have internal predecessors, (396), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:48:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 516 transitions. [2025-01-09 14:48:33,561 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 516 transitions. Word has length 438 [2025-01-09 14:48:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:33,562 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 516 transitions. [2025-01-09 14:48:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:48:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 516 transitions. [2025-01-09 14:48:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:48:33,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:33,567 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:48:33,768 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:48:33,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -398067514, now seen corresponding path program 1 times [2025-01-09 14:48:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:33,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460873981] [2025-01-09 14:48:33,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:33,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:48:33,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:48:33,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:33,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:34,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:34,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460873981] [2025-01-09 14:48:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460873981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:34,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:34,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536058159] [2025-01-09 14:48:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:34,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:34,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:34,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:34,200 INFO L87 Difference]: Start difference. First operand 320 states and 516 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:34,316 INFO L93 Difference]: Finished difference Result 883 states and 1423 transitions. [2025-01-09 14:48:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:34,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:48:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:34,322 INFO L225 Difference]: With dead ends: 883 [2025-01-09 14:48:34,322 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 14:48:34,327 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:48:34,328 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 373 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:34,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1039 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 14:48:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2025-01-09 14:48:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 468 states have (on average 1.5320512820512822) internal successors, (717), 469 states have internal predecessors, (717), 92 states have call successors, (92), 2 states have call predecessors, (92), 2 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:48:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 901 transitions. [2025-01-09 14:48:34,375 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 901 transitions. Word has length 438 [2025-01-09 14:48:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:34,377 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 901 transitions. [2025-01-09 14:48:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 901 transitions. [2025-01-09 14:48:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:48:34,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:34,382 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:48:34,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:34,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash 35661572, now seen corresponding path program 1 times [2025-01-09 14:48:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:34,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042456653] [2025-01-09 14:48:34,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:34,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:48:34,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:48:34,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:34,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042456653] [2025-01-09 14:48:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042456653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099574388] [2025-01-09 14:48:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:34,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:34,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:34,689 INFO L87 Difference]: Start difference. First operand 563 states and 901 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:34,772 INFO L93 Difference]: Finished difference Result 1520 states and 2420 transitions. [2025-01-09 14:48:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:34,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:48:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:34,779 INFO L225 Difference]: With dead ends: 1520 [2025-01-09 14:48:34,779 INFO L226 Difference]: Without dead ends: 960 [2025-01-09 14:48:34,780 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:48:34,780 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 313 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:34,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1205 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-01-09 14:48:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 957. [2025-01-09 14:48:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 792 states have (on average 1.5126262626262625) internal successors, (1198), 795 states have internal predecessors, (1198), 160 states have call successors, (160), 4 states have call predecessors, (160), 4 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:48:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1518 transitions. [2025-01-09 14:48:34,827 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1518 transitions. Word has length 438 [2025-01-09 14:48:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:34,832 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1518 transitions. [2025-01-09 14:48:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1518 transitions. [2025-01-09 14:48:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:48:34,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:34,841 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:48:34,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 714933826, now seen corresponding path program 1 times [2025-01-09 14:48:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:34,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098225293] [2025-01-09 14:48:34,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:48:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:48:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098225293] [2025-01-09 14:48:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098225293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965690789] [2025-01-09 14:48:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:35,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:35,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:35,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:35,095 INFO L87 Difference]: Start difference. First operand 957 states and 1518 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:35,189 INFO L93 Difference]: Finished difference Result 2861 states and 4544 transitions. [2025-01-09 14:48:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:48:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:35,198 INFO L225 Difference]: With dead ends: 2861 [2025-01-09 14:48:35,198 INFO L226 Difference]: Without dead ends: 1907 [2025-01-09 14:48:35,200 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:48:35,200 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 469 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:35,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1142 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2025-01-09 14:48:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1893. [2025-01-09 14:48:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1564 states have (on average 1.5051150895140666) internal successors, (2354), 1570 states have internal predecessors, (2354), 320 states have call successors, (320), 8 states have call predecessors, (320), 8 states have return successors, (320), 314 states have call predecessors, (320), 320 states have call successors, (320) [2025-01-09 14:48:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2994 transitions. [2025-01-09 14:48:35,342 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2994 transitions. Word has length 438 [2025-01-09 14:48:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2994 transitions. [2025-01-09 14:48:35,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2994 transitions. [2025-01-09 14:48:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:48:35,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:35,348 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:48:35,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:35,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2010371039, now seen corresponding path program 1 times [2025-01-09 14:48:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:35,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674432431] [2025-01-09 14:48:35,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:48:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:48:35,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:35,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674432431] [2025-01-09 14:48:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674432431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:36,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:36,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549422324] [2025-01-09 14:48:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:36,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:36,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:36,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:36,143 INFO L87 Difference]: Start difference. First operand 1893 states and 2994 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:36,309 INFO L93 Difference]: Finished difference Result 5559 states and 8789 transitions. [2025-01-09 14:48:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-01-09 14:48:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:36,328 INFO L225 Difference]: With dead ends: 5559 [2025-01-09 14:48:36,328 INFO L226 Difference]: Without dead ends: 3669 [2025-01-09 14:48:36,332 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:48:36,335 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 397 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:36,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1092 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2025-01-09 14:48:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3665. [2025-01-09 14:48:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 3008 states have (on average 1.4996675531914894) internal successors, (4511), 3020 states have internal predecessors, (4511), 640 states have call successors, (640), 16 states have call predecessors, (640), 16 states have return successors, (640), 628 states have call predecessors, (640), 640 states have call successors, (640) [2025-01-09 14:48:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5791 transitions. [2025-01-09 14:48:36,645 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5791 transitions. Word has length 439 [2025-01-09 14:48:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:36,646 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 5791 transitions. [2025-01-09 14:48:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5791 transitions. [2025-01-09 14:48:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:48:36,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:36,657 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:48:36,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1455616031, now seen corresponding path program 1 times [2025-01-09 14:48:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338055783] [2025-01-09 14:48:36,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:36,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:48:36,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:48:36,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:36,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:37,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:37,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338055783] [2025-01-09 14:48:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338055783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:37,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441461898] [2025-01-09 14:48:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:37,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:37,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:37,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:37,514 INFO L87 Difference]: Start difference. First operand 3665 states and 5791 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:37,909 INFO L93 Difference]: Finished difference Result 8987 states and 14252 transitions. [2025-01-09 14:48:37,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:37,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-01-09 14:48:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:37,935 INFO L225 Difference]: With dead ends: 8987 [2025-01-09 14:48:37,935 INFO L226 Difference]: Without dead ends: 5325 [2025-01-09 14:48:37,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:37,946 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 610 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:37,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1766 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2025-01-09 14:48:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4735. [2025-01-09 14:48:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3851 states have (on average 1.4954557257855103) internal successors, (5759), 3866 states have internal predecessors, (5759), 860 states have call successors, (860), 23 states have call predecessors, (860), 23 states have return successors, (860), 845 states have call predecessors, (860), 860 states have call successors, (860) [2025-01-09 14:48:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 7479 transitions. [2025-01-09 14:48:38,210 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 7479 transitions. Word has length 439 [2025-01-09 14:48:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:38,211 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 7479 transitions. [2025-01-09 14:48:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 7479 transitions. [2025-01-09 14:48:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-01-09 14:48:38,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:38,219 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:48:38,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:38,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -602789616, now seen corresponding path program 1 times [2025-01-09 14:48:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003825649] [2025-01-09 14:48:38,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:38,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-01-09 14:48:38,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-01-09 14:48:38,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:38,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003825649] [2025-01-09 14:48:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003825649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890507181] [2025-01-09 14:48:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:38,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:38,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:38,435 INFO L87 Difference]: Start difference. First operand 4735 states and 7479 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:38,657 INFO L93 Difference]: Finished difference Result 7579 states and 11990 transitions. [2025-01-09 14:48:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 440 [2025-01-09 14:48:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:38,679 INFO L225 Difference]: With dead ends: 7579 [2025-01-09 14:48:38,679 INFO L226 Difference]: Without dead ends: 3917 [2025-01-09 14:48:38,687 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:48:38,688 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 456 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:38,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1308 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:48:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2025-01-09 14:48:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3891. [2025-01-09 14:48:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3171 states have (on average 1.488804793440555) internal successors, (4721), 3183 states have internal predecessors, (4721), 700 states have call successors, (700), 19 states have call predecessors, (700), 19 states have return successors, (700), 688 states have call predecessors, (700), 700 states have call successors, (700) [2025-01-09 14:48:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 6121 transitions. [2025-01-09 14:48:38,929 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 6121 transitions. Word has length 440 [2025-01-09 14:48:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:38,930 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 6121 transitions. [2025-01-09 14:48:38,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 6121 transitions. [2025-01-09 14:48:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-01-09 14:48:38,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:38,937 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:48:38,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1974596914, now seen corresponding path program 1 times [2025-01-09 14:48:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459212116] [2025-01-09 14:48:38,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-01-09 14:48:39,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-01-09 14:48:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459212116] [2025-01-09 14:48:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459212116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139068030] [2025-01-09 14:48:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:39,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:39,842 INFO L87 Difference]: Start difference. First operand 3891 states and 6121 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:40,240 INFO L93 Difference]: Finished difference Result 9244 states and 14499 transitions. [2025-01-09 14:48:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:40,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 440 [2025-01-09 14:48:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:40,278 INFO L225 Difference]: With dead ends: 9244 [2025-01-09 14:48:40,278 INFO L226 Difference]: Without dead ends: 5475 [2025-01-09 14:48:40,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:40,286 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 530 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:40,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1472 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2025-01-09 14:48:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5269. [2025-01-09 14:48:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 4549 states have (on average 1.5106616838865685) internal successors, (6872), 4561 states have internal predecessors, (6872), 700 states have call successors, (700), 19 states have call predecessors, (700), 19 states have return successors, (700), 688 states have call predecessors, (700), 700 states have call successors, (700) [2025-01-09 14:48:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 8272 transitions. [2025-01-09 14:48:40,497 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 8272 transitions. Word has length 440 [2025-01-09 14:48:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:40,498 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 8272 transitions. [2025-01-09 14:48:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 8272 transitions. [2025-01-09 14:48:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:48:40,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:40,511 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:48:40,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2056444060, now seen corresponding path program 1 times [2025-01-09 14:48:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661572074] [2025-01-09 14:48:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:40,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:48:40,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:48:40,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661572074] [2025-01-09 14:48:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661572074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:42,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:42,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:48:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239567729] [2025-01-09 14:48:42,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:42,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:42,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:42,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:42,082 INFO L87 Difference]: Start difference. First operand 5269 states and 8272 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:43,584 INFO L93 Difference]: Finished difference Result 15694 states and 24364 transitions. [2025-01-09 14:48:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:48:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-01-09 14:48:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:43,614 INFO L225 Difference]: With dead ends: 15694 [2025-01-09 14:48:43,614 INFO L226 Difference]: Without dead ends: 10974 [2025-01-09 14:48:43,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:48:43,625 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 2484 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2484 SdHoareTripleChecker+Valid, 3882 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:43,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2484 Valid, 3882 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:48:43,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10974 states. [2025-01-09 14:48:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10974 to 7152. [2025-01-09 14:48:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7152 states, 6240 states have (on average 1.4958333333333333) internal successors, (9334), 6264 states have internal predecessors, (9334), 880 states have call successors, (880), 31 states have call predecessors, (880), 31 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:48:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 11094 transitions. [2025-01-09 14:48:43,889 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 11094 transitions. Word has length 441 [2025-01-09 14:48:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:43,894 INFO L471 AbstractCegarLoop]: Abstraction has 7152 states and 11094 transitions. [2025-01-09 14:48:43,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 11094 transitions. [2025-01-09 14:48:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:48:43,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:43,900 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:48:43,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -489686110, now seen corresponding path program 1 times [2025-01-09 14:48:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141818989] [2025-01-09 14:48:43,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:48:44,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:48:44,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:44,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141818989] [2025-01-09 14:48:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141818989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110286566] [2025-01-09 14:48:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:44,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:44,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:44,660 INFO L87 Difference]: Start difference. First operand 7152 states and 11094 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:45,321 INFO L93 Difference]: Finished difference Result 14266 states and 22056 transitions. [2025-01-09 14:48:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-01-09 14:48:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:45,341 INFO L225 Difference]: With dead ends: 14266 [2025-01-09 14:48:45,341 INFO L226 Difference]: Without dead ends: 7358 [2025-01-09 14:48:45,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:45,354 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 487 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:45,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1483 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:48:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7358 states. [2025-01-09 14:48:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7358 to 7152. [2025-01-09 14:48:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7152 states, 6240 states have (on average 1.494871794871795) internal successors, (9328), 6264 states have internal predecessors, (9328), 880 states have call successors, (880), 31 states have call predecessors, (880), 31 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:48:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 11088 transitions. [2025-01-09 14:48:45,728 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 11088 transitions. Word has length 441 [2025-01-09 14:48:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:45,729 INFO L471 AbstractCegarLoop]: Abstraction has 7152 states and 11088 transitions. [2025-01-09 14:48:45,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 11088 transitions. [2025-01-09 14:48:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:48:45,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:45,737 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:45,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:45,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 568151968, now seen corresponding path program 1 times [2025-01-09 14:48:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582415904] [2025-01-09 14:48:45,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:45,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:48:46,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:48:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582415904] [2025-01-09 14:48:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582415904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:46,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135331632] [2025-01-09 14:48:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:46,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:46,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:46,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:46,734 INFO L87 Difference]: Start difference. First operand 7152 states and 11088 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:47,296 INFO L93 Difference]: Finished difference Result 19572 states and 30263 transitions. [2025-01-09 14:48:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-01-09 14:48:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:47,331 INFO L225 Difference]: With dead ends: 19572 [2025-01-09 14:48:47,331 INFO L226 Difference]: Without dead ends: 13824 [2025-01-09 14:48:47,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:48:47,347 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 708 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:47,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1436 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13824 states. [2025-01-09 14:48:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13824 to 7792. [2025-01-09 14:48:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7792 states, 6880 states have (on average 1.497093023255814) internal successors, (10300), 6904 states have internal predecessors, (10300), 880 states have call successors, (880), 31 states have call predecessors, (880), 31 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:48:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 12060 transitions. [2025-01-09 14:48:47,717 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 12060 transitions. Word has length 441 [2025-01-09 14:48:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 7792 states and 12060 transitions. [2025-01-09 14:48:47,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 12060 transitions. [2025-01-09 14:48:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:48:47,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:47,724 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:48:47,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1691159456, now seen corresponding path program 1 times [2025-01-09 14:48:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:47,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213882722] [2025-01-09 14:48:47,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:47,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:48:48,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:48:48,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:48,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213882722] [2025-01-09 14:48:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213882722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430018474] [2025-01-09 14:48:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:48,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:48,636 INFO L87 Difference]: Start difference. First operand 7792 states and 12060 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:49,360 INFO L93 Difference]: Finished difference Result 20352 states and 31279 transitions. [2025-01-09 14:48:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-01-09 14:48:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:49,390 INFO L225 Difference]: With dead ends: 20352 [2025-01-09 14:48:49,390 INFO L226 Difference]: Without dead ends: 13444 [2025-01-09 14:48:49,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:48:49,401 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 655 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:49,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1053 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13444 states. [2025-01-09 14:48:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13444 to 7860. [2025-01-09 14:48:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7860 states, 6931 states have (on average 1.4934352907228394) internal successors, (10351), 6955 states have internal predecessors, (10351), 880 states have call successors, (880), 48 states have call predecessors, (880), 48 states have return successors, (880), 856 states have call predecessors, (880), 880 states have call successors, (880) [2025-01-09 14:48:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7860 states to 7860 states and 12111 transitions. [2025-01-09 14:48:49,950 INFO L78 Accepts]: Start accepts. Automaton has 7860 states and 12111 transitions. Word has length 441 [2025-01-09 14:48:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:49,951 INFO L471 AbstractCegarLoop]: Abstraction has 7860 states and 12111 transitions. [2025-01-09 14:48:49,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:48:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7860 states and 12111 transitions. [2025-01-09 14:48:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:48:49,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:49,960 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:49,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:49,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1727788834, now seen corresponding path program 1 times [2025-01-09 14:48:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132281629] [2025-01-09 14:48:49,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:49,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:48:50,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:48:50,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:48:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132281629] [2025-01-09 14:48:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132281629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:55,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 14:48:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880134327] [2025-01-09 14:48:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:55,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:48:55,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:55,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:48:55,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:48:55,681 INFO L87 Difference]: Start difference. First operand 7860 states and 12111 transitions. Second operand has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-01-09 14:49:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:03,383 INFO L93 Difference]: Finished difference Result 27196 states and 41508 transitions. [2025-01-09 14:49:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:49:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) Word has length 441 [2025-01-09 14:49:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:03,419 INFO L225 Difference]: With dead ends: 27196 [2025-01-09 14:49:03,419 INFO L226 Difference]: Without dead ends: 19462 [2025-01-09 14:49:03,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:49:03,429 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 6589 mSDsluCounter, 7826 mSDsCounter, 0 mSdLazyCounter, 5904 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6589 SdHoareTripleChecker+Valid, 8409 SdHoareTripleChecker+Invalid, 6174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 5904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:03,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6589 Valid, 8409 Invalid, 6174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 5904 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-01-09 14:49:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19462 states. [2025-01-09 14:49:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19462 to 12739. [2025-01-09 14:49:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12739 states, 11804 states have (on average 1.5233819044391732) internal successors, (17982), 11830 states have internal predecessors, (17982), 884 states have call successors, (884), 50 states have call predecessors, (884), 50 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12739 states to 12739 states and 19750 transitions. [2025-01-09 14:49:03,918 INFO L78 Accepts]: Start accepts. Automaton has 12739 states and 19750 transitions. Word has length 441 [2025-01-09 14:49:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:03,918 INFO L471 AbstractCegarLoop]: Abstraction has 12739 states and 19750 transitions. [2025-01-09 14:49:03,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 4 states have call successors, (60) [2025-01-09 14:49:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 12739 states and 19750 transitions. [2025-01-09 14:49:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:49:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:03,931 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:49:03,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2008776536, now seen corresponding path program 1 times [2025-01-09 14:49:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912822138] [2025-01-09 14:49:03,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:49:04,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:49:04,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:07,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912822138] [2025-01-09 14:49:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912822138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 14:49:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162689566] [2025-01-09 14:49:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:49:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:49:07,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:49:07,729 INFO L87 Difference]: Start difference. First operand 12739 states and 19750 transitions. Second operand has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:10,953 INFO L93 Difference]: Finished difference Result 42803 states and 65551 transitions. [2025-01-09 14:49:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:49:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 441 [2025-01-09 14:49:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:11,014 INFO L225 Difference]: With dead ends: 42803 [2025-01-09 14:49:11,015 INFO L226 Difference]: Without dead ends: 35035 [2025-01-09 14:49:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:49:11,035 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 4414 mSDsluCounter, 4982 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 5549 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 5549 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:49:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35035 states. [2025-01-09 14:49:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35035 to 14431. [2025-01-09 14:49:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14431 states, 13496 states have (on average 1.5284528749259039) internal successors, (20628), 13522 states have internal predecessors, (20628), 884 states have call successors, (884), 50 states have call predecessors, (884), 50 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14431 states to 14431 states and 22396 transitions. [2025-01-09 14:49:11,566 INFO L78 Accepts]: Start accepts. Automaton has 14431 states and 22396 transitions. Word has length 441 [2025-01-09 14:49:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:11,567 INFO L471 AbstractCegarLoop]: Abstraction has 14431 states and 22396 transitions. [2025-01-09 14:49:11,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14431 states and 22396 transitions. [2025-01-09 14:49:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:49:11,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:11,580 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:11,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:49:11,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:11,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1294059748, now seen corresponding path program 1 times [2025-01-09 14:49:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661090411] [2025-01-09 14:49:11,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:11,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:49:12,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:49:12,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:12,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661090411] [2025-01-09 14:49:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661090411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 14:49:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396095478] [2025-01-09 14:49:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:17,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:49:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:17,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:49:17,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:49:17,221 INFO L87 Difference]: Start difference. First operand 14431 states and 22396 transitions. Second operand has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-01-09 14:49:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:25,927 INFO L93 Difference]: Finished difference Result 31943 states and 48349 transitions. [2025-01-09 14:49:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:49:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 441 [2025-01-09 14:49:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:25,984 INFO L225 Difference]: With dead ends: 31943 [2025-01-09 14:49:25,985 INFO L226 Difference]: Without dead ends: 28725 [2025-01-09 14:49:25,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 14:49:25,994 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 9920 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 5515 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9920 SdHoareTripleChecker+Valid, 6435 SdHoareTripleChecker+Invalid, 5931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 5515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:25,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9920 Valid, 6435 Invalid, 5931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 5515 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-01-09 14:49:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28725 states. [2025-01-09 14:49:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28725 to 14613. [2025-01-09 14:49:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14613 states, 13678 states have (on average 1.529244041526539) internal successors, (20917), 13704 states have internal predecessors, (20917), 884 states have call successors, (884), 50 states have call predecessors, (884), 50 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14613 states to 14613 states and 22685 transitions. [2025-01-09 14:49:26,384 INFO L78 Accepts]: Start accepts. Automaton has 14613 states and 22685 transitions. Word has length 441 [2025-01-09 14:49:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:26,385 INFO L471 AbstractCegarLoop]: Abstraction has 14613 states and 22685 transitions. [2025-01-09 14:49:26,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.545454545454546) internal successors, (144), 22 states have internal predecessors, (144), 4 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-01-09 14:49:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 14613 states and 22685 transitions. [2025-01-09 14:49:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:49:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:26,398 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:49:26,398 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1852461674, now seen corresponding path program 1 times [2025-01-09 14:49:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030651644] [2025-01-09 14:49:26,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:49:26,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:49:26,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:26,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:28,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:28,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030651644] [2025-01-09 14:49:28,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030651644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:28,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:28,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:49:28,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296690614] [2025-01-09 14:49:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:49:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:28,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:49:28,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:49:28,345 INFO L87 Difference]: Start difference. First operand 14613 states and 22685 transitions. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:30,432 INFO L93 Difference]: Finished difference Result 35696 states and 55107 transitions. [2025-01-09 14:49:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:49:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-01-09 14:49:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:30,473 INFO L225 Difference]: With dead ends: 35696 [2025-01-09 14:49:30,473 INFO L226 Difference]: Without dead ends: 29226 [2025-01-09 14:49:30,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:49:30,490 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1807 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:30,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2925 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:49:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29226 states. [2025-01-09 14:49:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29226 to 20243. [2025-01-09 14:49:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20243 states, 19308 states have (on average 1.5482183550859747) internal successors, (29893), 19334 states have internal predecessors, (29893), 884 states have call successors, (884), 50 states have call predecessors, (884), 50 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 31661 transitions. [2025-01-09 14:49:30,919 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 31661 transitions. Word has length 441 [2025-01-09 14:49:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 20243 states and 31661 transitions. [2025-01-09 14:49:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 31661 transitions. [2025-01-09 14:49:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 14:49:30,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:30,942 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:49:30,942 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2089417240, now seen corresponding path program 1 times [2025-01-09 14:49:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975557349] [2025-01-09 14:49:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:30,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 14:49:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 14:49:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975557349] [2025-01-09 14:49:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975557349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:49:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838150920] [2025-01-09 14:49:31,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:49:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:31,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:49:31,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:49:31,616 INFO L87 Difference]: Start difference. First operand 20243 states and 31661 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:32,542 INFO L93 Difference]: Finished difference Result 33494 states and 51889 transitions. [2025-01-09 14:49:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:49:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 441 [2025-01-09 14:49:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:32,604 INFO L225 Difference]: With dead ends: 33494 [2025-01-09 14:49:32,607 INFO L226 Difference]: Without dead ends: 22222 [2025-01-09 14:49:32,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:49:32,644 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 2152 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:32,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2701 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:49:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22222 states. [2025-01-09 14:49:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22222 to 17749. [2025-01-09 14:49:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17749 states, 16813 states have (on average 1.5332183429489086) internal successors, (25778), 16839 states have internal predecessors, (25778), 884 states have call successors, (884), 51 states have call predecessors, (884), 51 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17749 states to 17749 states and 27546 transitions. [2025-01-09 14:49:33,080 INFO L78 Accepts]: Start accepts. Automaton has 17749 states and 27546 transitions. Word has length 441 [2025-01-09 14:49:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:33,080 INFO L471 AbstractCegarLoop]: Abstraction has 17749 states and 27546 transitions. [2025-01-09 14:49:33,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17749 states and 27546 transitions. [2025-01-09 14:49:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 14:49:33,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:33,096 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:33,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:49:33,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:33,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash 750401614, now seen corresponding path program 1 times [2025-01-09 14:49:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712125739] [2025-01-09 14:49:33,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:33,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 14:49:33,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 14:49:33,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:33,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712125739] [2025-01-09 14:49:38,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712125739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:38,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:38,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 14:49:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207142835] [2025-01-09 14:49:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:38,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:49:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:38,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:49:38,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:49:38,719 INFO L87 Difference]: Start difference. First operand 17749 states and 27546 transitions. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:48,075 INFO L93 Difference]: Finished difference Result 35169 states and 53471 transitions. [2025-01-09 14:49:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 14:49:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 442 [2025-01-09 14:49:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:48,120 INFO L225 Difference]: With dead ends: 35169 [2025-01-09 14:49:48,121 INFO L226 Difference]: Without dead ends: 31171 [2025-01-09 14:49:48,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 14:49:48,135 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 5828 mSDsluCounter, 5619 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5828 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:48,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5828 Valid, 6186 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 14:49:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31171 states. [2025-01-09 14:49:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31171 to 19021. [2025-01-09 14:49:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19021 states, 18085 states have (on average 1.5346419684821675) internal successors, (27754), 18111 states have internal predecessors, (27754), 884 states have call successors, (884), 51 states have call predecessors, (884), 51 states have return successors, (884), 858 states have call predecessors, (884), 884 states have call successors, (884) [2025-01-09 14:49:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19021 states to 19021 states and 29522 transitions. [2025-01-09 14:49:48,584 INFO L78 Accepts]: Start accepts. Automaton has 19021 states and 29522 transitions. Word has length 442 [2025-01-09 14:49:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 19021 states and 29522 transitions. [2025-01-09 14:49:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 19021 states and 29522 transitions. [2025-01-09 14:49:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 14:49:48,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:48,601 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:49:48,601 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 191999688, now seen corresponding path program 1 times [2025-01-09 14:49:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286003383] [2025-01-09 14:49:48,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:48,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 14:49:48,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 14:49:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat