./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c -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 8d6ab270424ffa2caaf27b7ac8ad862ff93b45999f126eddc180d440bd9f4c92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:51:10,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:51:10,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:51:10,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:51:10,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:51:10,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:51:10,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:51:10,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:51:10,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:51:10,398 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:51:10,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:51:10,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:51:10,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:51:10,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:51:10,399 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:51:10,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:51:10,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:51:10,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:51:10,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:51:10,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:51:10,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:51:10,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:51:10,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:51:10,401 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 -> 8d6ab270424ffa2caaf27b7ac8ad862ff93b45999f126eddc180d440bd9f4c92 [2025-02-05 17:51:10,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:51:10,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:51:10,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:51:10,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:51:10,745 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:51:10,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2025-02-05 17:51:12,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404c72094/61d6e721650a472c8836d47a77eae75f/FLAGd1da5dc17 [2025-02-05 17:51:12,625 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:51:12,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2025-02-05 17:51:12,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404c72094/61d6e721650a472c8836d47a77eae75f/FLAGd1da5dc17 [2025-02-05 17:51:12,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/404c72094/61d6e721650a472c8836d47a77eae75f [2025-02-05 17:51:12,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:51:12,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:51:12,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:51:12,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:51:12,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:51:12,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:51:12" (1/1) ... [2025-02-05 17:51:12,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:12, skipping insertion in model container [2025-02-05 17:51:12,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:51:12" (1/1) ... [2025-02-05 17:51:12,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:51:13,211 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c[26860,26873] [2025-02-05 17:51:13,259 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c[30367,30380] [2025-02-05 17:51:13,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:51:13,791 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:51:13,837 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c[26860,26873] [2025-02-05 17:51:13,842 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c[30367,30380] [2025-02-05 17:51:14,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:51:14,196 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:51:14,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14 WrapperNode [2025-02-05 17:51:14,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:51:14,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:51:14,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:51:14,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:51:14,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,585 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5287 [2025-02-05 17:51:14,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:51:14,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:51:14,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:51:14,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:51:14,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,817 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:51:14,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:14,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:15,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:51:15,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:51:15,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:51:15,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:51:15,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (1/1) ... [2025-02-05 17:51:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:51:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:51:15,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:51:15,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:51:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:51:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:51:15,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:51:15,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:51:15,263 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:51:15,266 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:51:19,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc calculate_output_#t~ret50#1; [2025-02-05 17:51:19,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3852: havoc calculate_output2_#t~ret51#1; [2025-02-05 17:51:19,715 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5342: havoc calculate_output3_#t~ret52#1; [2025-02-05 17:51:19,918 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-02-05 17:51:19,918 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:51:19,958 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:51:19,959 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:51:19,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:51:19 BoogieIcfgContainer [2025-02-05 17:51:19,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:51:19,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:51:19,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:51:19,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:51:19,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:51:12" (1/3) ... [2025-02-05 17:51:19,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d22d231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:51:19, skipping insertion in model container [2025-02-05 17:51:19,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:51:14" (2/3) ... [2025-02-05 17:51:19,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d22d231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:51:19, skipping insertion in model container [2025-02-05 17:51:19,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:51:19" (3/3) ... [2025-02-05 17:51:19,968 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c [2025-02-05 17:51:19,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:51:19,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label08.c that has 1 procedures, 946 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:51:20,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:51:20,136 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;@49ec5fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:51:20,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:51:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:51:20,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:20,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:20,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash -175212786, now seen corresponding path program 1 times [2025-02-05 17:51:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277029107] [2025-02-05 17:51:20,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:51:20,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:51:20,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:20,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277029107] [2025-02-05 17:51:20,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277029107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:20,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:20,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:51:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262532961] [2025-02-05 17:51:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:20,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:51:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:51:20,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:51:20,514 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:20,584 INFO L93 Difference]: Finished difference Result 1825 states and 3458 transitions. [2025-02-05 17:51:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:51:20,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-05 17:51:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:20,605 INFO L225 Difference]: With dead ends: 1825 [2025-02-05 17:51:20,606 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:51:20,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:51:20,616 INFO L435 NwaCegarLoop]: 1730 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, 1730 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-02-05 17:51:20,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:51:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-02-05 17:51:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2025-02-05 17:51:20,697 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2025-02-05 17:51:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:20,697 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2025-02-05 17:51:20,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2025-02-05 17:51:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:51:20,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:20,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:20,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:51:20,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:20,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash -242219539, now seen corresponding path program 1 times [2025-02-05 17:51:20,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387105583] [2025-02-05 17:51:20,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:51:20,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:51:20,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:21,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387105583] [2025-02-05 17:51:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387105583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:21,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:51:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894676489] [2025-02-05 17:51:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:51:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:21,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:51:21,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:51:21,049 INFO L87 Difference]: Start difference. First operand 881 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:21,186 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2025-02-05 17:51:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:51:21,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-05 17:51:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:21,192 INFO L225 Difference]: With dead ends: 945 [2025-02-05 17:51:21,192 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:51:21,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:51:21,194 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:21,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:51:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:51:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-02-05 17:51:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2025-02-05 17:51:21,221 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2025-02-05 17:51:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:21,221 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2025-02-05 17:51:21,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2025-02-05 17:51:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:51:21,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:21,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:21,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:51:21,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1012654249, now seen corresponding path program 1 times [2025-02-05 17:51:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277611337] [2025-02-05 17:51:21,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:51:21,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:51:21,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:21,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277611337] [2025-02-05 17:51:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277611337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:51:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637399361] [2025-02-05 17:51:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:21,336 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:24,538 INFO L93 Difference]: Finished difference Result 2385 states and 4476 transitions. [2025-02-05 17:51:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-05 17:51:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:24,546 INFO L225 Difference]: With dead ends: 2385 [2025-02-05 17:51:24,546 INFO L226 Difference]: Without dead ends: 1632 [2025-02-05 17:51:24,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:24,548 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 952 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:24,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 592 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 17:51:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-02-05 17:51:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2025-02-05 17:51:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1630 states have (on average 1.6134969325153374) internal successors, (2630), 1631 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2630 transitions. [2025-02-05 17:51:24,583 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2630 transitions. Word has length 30 [2025-02-05 17:51:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2630 transitions. [2025-02-05 17:51:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2630 transitions. [2025-02-05 17:51:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:51:24,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:24,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:51:24,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1925042417, now seen corresponding path program 1 times [2025-02-05 17:51:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33603796] [2025-02-05 17:51:24,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:51:24,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:51:24,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33603796] [2025-02-05 17:51:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33603796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:51:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418705850] [2025-02-05 17:51:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:51:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:51:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:51:24,976 INFO L87 Difference]: Start difference. First operand 1632 states and 2630 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:25,530 INFO L93 Difference]: Finished difference Result 2592 states and 4182 transitions. [2025-02-05 17:51:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 17:51:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:51:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:25,543 INFO L225 Difference]: With dead ends: 2592 [2025-02-05 17:51:25,543 INFO L226 Difference]: Without dead ends: 2532 [2025-02-05 17:51:25,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:51:25,547 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13289 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13289 SdHoareTripleChecker+Valid, 7095 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:25,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13289 Valid, 7095 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:51:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-02-05 17:51:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1690. [2025-02-05 17:51:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.613744075829384) internal successors, (2724), 1689 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2724 transitions. [2025-02-05 17:51:25,593 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2724 transitions. Word has length 90 [2025-02-05 17:51:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:25,595 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2724 transitions. [2025-02-05 17:51:25,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2724 transitions. [2025-02-05 17:51:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:51:25,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:25,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:25,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:51:25,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:25,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash -44788596, now seen corresponding path program 1 times [2025-02-05 17:51:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697679494] [2025-02-05 17:51:25,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:25,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:51:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:51:25,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697679494] [2025-02-05 17:51:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697679494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:25,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959993221] [2025-02-05 17:51:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:25,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:25,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:25,755 INFO L87 Difference]: Start difference. First operand 1690 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:25,786 INFO L93 Difference]: Finished difference Result 1915 states and 3087 transitions. [2025-02-05 17:51:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:25,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 17:51:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:25,793 INFO L225 Difference]: With dead ends: 1915 [2025-02-05 17:51:25,793 INFO L226 Difference]: Without dead ends: 1797 [2025-02-05 17:51:25,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:25,794 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:25,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-02-05 17:51:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2025-02-05 17:51:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6129392080312326) internal successors, (2892), 1794 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2892 transitions. [2025-02-05 17:51:25,832 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2892 transitions. Word has length 92 [2025-02-05 17:51:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2892 transitions. [2025-02-05 17:51:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2892 transitions. [2025-02-05 17:51:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:51:25,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:25,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:25,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:51:25,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash -12465361, now seen corresponding path program 1 times [2025-02-05 17:51:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094843399] [2025-02-05 17:51:25,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:25,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:51:25,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:51:25,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:25,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094843399] [2025-02-05 17:51:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094843399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:51:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138177632] [2025-02-05 17:51:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:51:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:51:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:51:26,403 INFO L87 Difference]: Start difference. First operand 1795 states and 2892 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:26,819 INFO L93 Difference]: Finished difference Result 2020 states and 3252 transitions. [2025-02-05 17:51:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:51:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 17:51:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:26,828 INFO L225 Difference]: With dead ends: 2020 [2025-02-05 17:51:26,828 INFO L226 Difference]: Without dead ends: 1797 [2025-02-05 17:51:26,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 17:51:26,831 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 3096 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:26,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 2269 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:51:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-02-05 17:51:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2025-02-05 17:51:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6118237590630229) internal successors, (2890), 1794 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2890 transitions. [2025-02-05 17:51:26,869 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2890 transitions. Word has length 92 [2025-02-05 17:51:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:26,870 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2890 transitions. [2025-02-05 17:51:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2890 transitions. [2025-02-05 17:51:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 17:51:26,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:26,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:51:26,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -355888457, now seen corresponding path program 1 times [2025-02-05 17:51:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204342259] [2025-02-05 17:51:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 17:51:26,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 17:51:26,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:26,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204342259] [2025-02-05 17:51:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204342259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:51:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594821005] [2025-02-05 17:51:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:51:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:51:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:51:27,254 INFO L87 Difference]: Start difference. First operand 1795 states and 2890 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:27,318 INFO L93 Difference]: Finished difference Result 1803 states and 2899 transitions. [2025-02-05 17:51:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:51:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 17:51:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:27,327 INFO L225 Difference]: With dead ends: 1803 [2025-02-05 17:51:27,327 INFO L226 Difference]: Without dead ends: 1801 [2025-02-05 17:51:27,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:51:27,328 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 0 mSDsluCounter, 9569 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11166 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:27,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11166 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-02-05 17:51:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2025-02-05 17:51:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.6092273485269595) internal successors, (2895), 1800 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2895 transitions. [2025-02-05 17:51:27,371 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2895 transitions. Word has length 93 [2025-02-05 17:51:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:27,371 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2895 transitions. [2025-02-05 17:51:27,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2895 transitions. [2025-02-05 17:51:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:27,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:27,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:51:27,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash -574592115, now seen corresponding path program 1 times [2025-02-05 17:51:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301452079] [2025-02-05 17:51:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:27,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:27,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:27,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:27,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301452079] [2025-02-05 17:51:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301452079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813214102] [2025-02-05 17:51:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:27,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:27,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:27,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,481 INFO L87 Difference]: Start difference. First operand 1801 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:27,513 INFO L93 Difference]: Finished difference Result 2043 states and 3276 transitions. [2025-02-05 17:51:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:27,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:27,521 INFO L225 Difference]: With dead ends: 2043 [2025-02-05 17:51:27,521 INFO L226 Difference]: Without dead ends: 1919 [2025-02-05 17:51:27,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,522 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:27,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-02-05 17:51:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1917. [2025-02-05 17:51:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1915 states have (on average 1.606266318537859) internal successors, (3076), 1916 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3076 transitions. [2025-02-05 17:51:27,563 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3076 transitions. Word has length 94 [2025-02-05 17:51:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 3076 transitions. [2025-02-05 17:51:27,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3076 transitions. [2025-02-05 17:51:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:27,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:27,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:27,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:51:27,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -583233459, now seen corresponding path program 1 times [2025-02-05 17:51:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141316730] [2025-02-05 17:51:27,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:27,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:27,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:27,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:27,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141316730] [2025-02-05 17:51:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141316730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222126411] [2025-02-05 17:51:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:27,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:27,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:27,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,659 INFO L87 Difference]: Start difference. First operand 1917 states and 3076 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:27,693 INFO L93 Difference]: Finished difference Result 2579 states and 4116 transitions. [2025-02-05 17:51:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:27,703 INFO L225 Difference]: With dead ends: 2579 [2025-02-05 17:51:27,703 INFO L226 Difference]: Without dead ends: 2236 [2025-02-05 17:51:27,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,705 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:27,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-02-05 17:51:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2025-02-05 17:51:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2232 states have (on average 1.5985663082437276) internal successors, (3568), 2233 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3568 transitions. [2025-02-05 17:51:27,794 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3568 transitions. Word has length 94 [2025-02-05 17:51:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 2234 states and 3568 transitions. [2025-02-05 17:51:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3568 transitions. [2025-02-05 17:51:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:27,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:27,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:51:27,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:27,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1392174349, now seen corresponding path program 1 times [2025-02-05 17:51:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:27,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816048195] [2025-02-05 17:51:27,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:27,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816048195] [2025-02-05 17:51:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816048195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678920247] [2025-02-05 17:51:27,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:27,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:27,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,888 INFO L87 Difference]: Start difference. First operand 2234 states and 3568 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:27,928 INFO L93 Difference]: Finished difference Result 3506 states and 5550 transitions. [2025-02-05 17:51:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:27,940 INFO L225 Difference]: With dead ends: 3506 [2025-02-05 17:51:27,941 INFO L226 Difference]: Without dead ends: 2846 [2025-02-05 17:51:27,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:27,943 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:27,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-02-05 17:51:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2844. [2025-02-05 17:51:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2842 states have (on average 1.5847994370161858) internal successors, (4504), 2843 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4504 transitions. [2025-02-05 17:51:28,008 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4504 transitions. Word has length 94 [2025-02-05 17:51:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 4504 transitions. [2025-02-05 17:51:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4504 transitions. [2025-02-05 17:51:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:28,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:28,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:28,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:51:28,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1237805517, now seen corresponding path program 1 times [2025-02-05 17:51:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:28,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867516974] [2025-02-05 17:51:28,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:28,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:28,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:28,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:28,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:28,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:28,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867516974] [2025-02-05 17:51:28,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867516974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:28,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:28,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872589191] [2025-02-05 17:51:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:28,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:28,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:28,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:28,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,100 INFO L87 Difference]: Start difference. First operand 2844 states and 4504 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:28,148 INFO L93 Difference]: Finished difference Result 5288 states and 8274 transitions. [2025-02-05 17:51:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:28,164 INFO L225 Difference]: With dead ends: 5288 [2025-02-05 17:51:28,165 INFO L226 Difference]: Without dead ends: 4018 [2025-02-05 17:51:28,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,169 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:28,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2025-02-05 17:51:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 4016. [2025-02-05 17:51:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4016 states, 4014 states have (on average 1.5645241654210265) internal successors, (6280), 4015 states have internal predecessors, (6280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 6280 transitions. [2025-02-05 17:51:28,258 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 6280 transitions. Word has length 94 [2025-02-05 17:51:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:28,258 INFO L471 AbstractCegarLoop]: Abstraction has 4016 states and 6280 transitions. [2025-02-05 17:51:28,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 6280 transitions. [2025-02-05 17:51:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:28,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:28,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:51:28,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:28,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 258875021, now seen corresponding path program 1 times [2025-02-05 17:51:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590355685] [2025-02-05 17:51:28,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:28,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:28,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:28,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:28,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:28,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:28,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590355685] [2025-02-05 17:51:28,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590355685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:28,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:28,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:28,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726504670] [2025-02-05 17:51:28,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:28,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:28,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:28,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:28,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,338 INFO L87 Difference]: Start difference. First operand 4016 states and 6280 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:28,408 INFO L93 Difference]: Finished difference Result 8708 states and 13434 transitions. [2025-02-05 17:51:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:28,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:28,432 INFO L225 Difference]: With dead ends: 8708 [2025-02-05 17:51:28,432 INFO L226 Difference]: Without dead ends: 6266 [2025-02-05 17:51:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,438 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1795 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2025-02-05 17:51:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6264. [2025-02-05 17:51:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 6262 states have (on average 1.5394442670073458) internal successors, (9640), 6263 states have internal predecessors, (9640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 9640 transitions. [2025-02-05 17:51:28,609 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 9640 transitions. Word has length 94 [2025-02-05 17:51:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:28,609 INFO L471 AbstractCegarLoop]: Abstraction has 6264 states and 9640 transitions. [2025-02-05 17:51:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 9640 transitions. [2025-02-05 17:51:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:28,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:28,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:28,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:51:28,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -189070515, now seen corresponding path program 1 times [2025-02-05 17:51:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901668678] [2025-02-05 17:51:28,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:28,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901668678] [2025-02-05 17:51:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901668678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756593754] [2025-02-05 17:51:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:28,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:28,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,696 INFO L87 Difference]: Start difference. First operand 6264 states and 9640 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:28,901 INFO L93 Difference]: Finished difference Result 15260 states and 23178 transitions. [2025-02-05 17:51:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:28,930 INFO L225 Difference]: With dead ends: 15260 [2025-02-05 17:51:28,930 INFO L226 Difference]: Without dead ends: 10570 [2025-02-05 17:51:28,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:28,941 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:28,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1797 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2025-02-05 17:51:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 10568. [2025-02-05 17:51:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10568 states, 10566 states have (on average 1.512019685784592) internal successors, (15976), 10567 states have internal predecessors, (15976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10568 states to 10568 states and 15976 transitions. [2025-02-05 17:51:29,248 INFO L78 Accepts]: Start accepts. Automaton has 10568 states and 15976 transitions. Word has length 94 [2025-02-05 17:51:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:29,248 INFO L471 AbstractCegarLoop]: Abstraction has 10568 states and 15976 transitions. [2025-02-05 17:51:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10568 states and 15976 transitions. [2025-02-05 17:51:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:29,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:29,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:29,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:51:29,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:29,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash 226105357, now seen corresponding path program 1 times [2025-02-05 17:51:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:29,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609286811] [2025-02-05 17:51:29,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:29,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:29,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:29,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:29,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609286811] [2025-02-05 17:51:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609286811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464436452] [2025-02-05 17:51:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:29,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:29,330 INFO L87 Difference]: Start difference. First operand 10568 states and 15976 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:29,539 INFO L93 Difference]: Finished difference Result 27788 states and 41514 transitions. [2025-02-05 17:51:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:29,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:29,584 INFO L225 Difference]: With dead ends: 27788 [2025-02-05 17:51:29,585 INFO L226 Difference]: Without dead ends: 18794 [2025-02-05 17:51:29,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:29,603 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:29,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18794 states. [2025-02-05 17:51:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18794 to 18792. [2025-02-05 17:51:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18792 states, 18790 states have (on average 1.4837679616817456) internal successors, (27880), 18791 states have internal predecessors, (27880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 27880 transitions. [2025-02-05 17:51:30,136 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 27880 transitions. Word has length 94 [2025-02-05 17:51:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:30,136 INFO L471 AbstractCegarLoop]: Abstraction has 18792 states and 27880 transitions. [2025-02-05 17:51:30,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 27880 transitions. [2025-02-05 17:51:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:51:30,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:30,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:30,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:51:30,137 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:30,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash -260612915, now seen corresponding path program 1 times [2025-02-05 17:51:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229409905] [2025-02-05 17:51:30,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:30,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:51:30,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:51:30,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:30,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229409905] [2025-02-05 17:51:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229409905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:51:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678631136] [2025-02-05 17:51:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:30,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:30,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:30,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:30,217 INFO L87 Difference]: Start difference. First operand 18792 states and 27880 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:30,701 INFO L93 Difference]: Finished difference Result 51692 states and 75882 transitions. [2025-02-05 17:51:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:51:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:30,783 INFO L225 Difference]: With dead ends: 51692 [2025-02-05 17:51:30,783 INFO L226 Difference]: Without dead ends: 34474 [2025-02-05 17:51:30,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:30,812 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:30,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:51:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34474 states. [2025-02-05 17:51:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34474 to 34472. [2025-02-05 17:51:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34472 states, 34470 states have (on average 1.4549463301421526) internal successors, (50152), 34471 states have internal predecessors, (50152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34472 states to 34472 states and 50152 transitions. [2025-02-05 17:51:31,731 INFO L78 Accepts]: Start accepts. Automaton has 34472 states and 50152 transitions. Word has length 94 [2025-02-05 17:51:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 34472 states and 50152 transitions. [2025-02-05 17:51:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34472 states and 50152 transitions. [2025-02-05 17:51:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:51:31,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:31,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:51:31,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:31,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash -329959565, now seen corresponding path program 1 times [2025-02-05 17:51:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551848288] [2025-02-05 17:51:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:31,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:51:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:51:31,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:31,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:51:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551848288] [2025-02-05 17:51:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551848288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:31,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:51:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152170728] [2025-02-05 17:51:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:31,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:31,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:31,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:31,834 INFO L87 Difference]: Start difference. First operand 34472 states and 50152 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:35,247 INFO L93 Difference]: Finished difference Result 37478 states and 55079 transitions. [2025-02-05 17:51:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:35,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 17:51:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:35,339 INFO L225 Difference]: With dead ends: 37478 [2025-02-05 17:51:35,339 INFO L226 Difference]: Without dead ends: 35974 [2025-02-05 17:51:35,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:35,354 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 889 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:35,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 639 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 17:51:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35974 states. [2025-02-05 17:51:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35974 to 35974. [2025-02-05 17:51:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35974 states, 35972 states have (on average 1.4447903925275214) internal successors, (51972), 35973 states have internal predecessors, (51972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 51972 transitions. [2025-02-05 17:51:36,332 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 51972 transitions. Word has length 101 [2025-02-05 17:51:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:36,332 INFO L471 AbstractCegarLoop]: Abstraction has 35974 states and 51972 transitions. [2025-02-05 17:51:36,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 51972 transitions. [2025-02-05 17:51:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 17:51:36,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:36,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:36,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:51:36,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:36,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1404277379, now seen corresponding path program 1 times [2025-02-05 17:51:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922195978] [2025-02-05 17:51:36,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 17:51:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 17:51:36,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:36,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:51:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922195978] [2025-02-05 17:51:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922195978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:36,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:51:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777626445] [2025-02-05 17:51:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:51:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:36,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:51:36,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:36,435 INFO L87 Difference]: Start difference. First operand 35974 states and 51972 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:39,980 INFO L93 Difference]: Finished difference Result 41986 states and 60540 transitions. [2025-02-05 17:51:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:51:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 17:51:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:40,063 INFO L225 Difference]: With dead ends: 41986 [2025-02-05 17:51:40,064 INFO L226 Difference]: Without dead ends: 38980 [2025-02-05 17:51:40,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:51:40,077 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1079 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:40,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 747 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 17:51:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38980 states. [2025-02-05 17:51:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38980 to 38978. [2025-02-05 17:51:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38978 states, 38976 states have (on average 1.4283918308702792) internal successors, (55673), 38977 states have internal predecessors, (55673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38978 states to 38978 states and 55673 transitions. [2025-02-05 17:51:40,916 INFO L78 Accepts]: Start accepts. Automaton has 38978 states and 55673 transitions. Word has length 105 [2025-02-05 17:51:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:40,916 INFO L471 AbstractCegarLoop]: Abstraction has 38978 states and 55673 transitions. [2025-02-05 17:51:40,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38978 states and 55673 transitions. [2025-02-05 17:51:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:51:40,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:40,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:51:40,927 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:40,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1654830979, now seen corresponding path program 1 times [2025-02-05 17:51:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927385235] [2025-02-05 17:51:40,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:40,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:51:40,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:51:40,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:40,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:51:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:41,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927385235] [2025-02-05 17:51:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927385235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:51:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820154332] [2025-02-05 17:51:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:41,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:51:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:51:41,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:51:41,242 INFO L87 Difference]: Start difference. First operand 38978 states and 55673 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:44,875 INFO L93 Difference]: Finished difference Result 298964 states and 431746 transitions. [2025-02-05 17:51:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:51:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 17:51:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:45,520 INFO L225 Difference]: With dead ends: 298964 [2025-02-05 17:51:45,520 INFO L226 Difference]: Without dead ends: 275922 [2025-02-05 17:51:45,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:51:45,602 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11629 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11629 SdHoareTripleChecker+Valid, 5590 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:45,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11629 Valid, 5590 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:51:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275922 states. [2025-02-05 17:51:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275922 to 67010. [2025-02-05 17:51:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67010 states, 67008 states have (on average 1.4306500716332378) internal successors, (95865), 67009 states have internal predecessors, (95865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67010 states to 67010 states and 95865 transitions. [2025-02-05 17:51:49,235 INFO L78 Accepts]: Start accepts. Automaton has 67010 states and 95865 transitions. Word has length 119 [2025-02-05 17:51:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:49,236 INFO L471 AbstractCegarLoop]: Abstraction has 67010 states and 95865 transitions. [2025-02-05 17:51:49,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 67010 states and 95865 transitions. [2025-02-05 17:51:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:51:49,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:49,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:51:49,249 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1646189635, now seen corresponding path program 1 times [2025-02-05 17:51:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153323372] [2025-02-05 17:51:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:49,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:51:49,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:51:49,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:49,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:51:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153323372] [2025-02-05 17:51:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153323372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:49,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:49,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:51:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450433276] [2025-02-05 17:51:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:51:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:49,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:51:49,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:51:49,594 INFO L87 Difference]: Start difference. First operand 67010 states and 95865 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:54,925 INFO L93 Difference]: Finished difference Result 331860 states and 479106 transitions. [2025-02-05 17:51:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:51:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-02-05 17:51:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:55,444 INFO L225 Difference]: With dead ends: 331860 [2025-02-05 17:51:55,444 INFO L226 Difference]: Without dead ends: 298962 [2025-02-05 17:51:55,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:51:55,524 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 11631 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11631 SdHoareTripleChecker+Valid, 5537 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:55,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11631 Valid, 5537 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:51:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298962 states. [2025-02-05 17:51:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298962 to 111426. [2025-02-05 17:51:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111426 states, 111424 states have (on average 1.4312984635267088) internal successors, (159481), 111425 states have internal predecessors, (159481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:52:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111426 states to 111426 states and 159481 transitions. [2025-02-05 17:52:00,059 INFO L78 Accepts]: Start accepts. Automaton has 111426 states and 159481 transitions. Word has length 119 [2025-02-05 17:52:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:00,059 INFO L471 AbstractCegarLoop]: Abstraction has 111426 states and 159481 transitions. [2025-02-05 17:52:00,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:52:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 111426 states and 159481 transitions. [2025-02-05 17:52:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:52:00,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:00,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:00,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:52:00,071 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash -673369853, now seen corresponding path program 1 times [2025-02-05 17:52:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345607828] [2025-02-05 17:52:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:52:00,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:52:00,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:00,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:52:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345607828] [2025-02-05 17:52:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345607828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:52:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869598892] [2025-02-05 17:52:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:00,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:52:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:52:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:52:00,345 INFO L87 Difference]: Start difference. First operand 111426 states and 159481 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)