./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.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 5a8db184ab7332ab7843787a030506038544a962a60c0b43f4b663ada8e12be3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:57:42,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:57:42,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:57:42,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:57:42,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:57:42,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:57:42,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:57:42,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:57:42,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:57:42,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:57:42,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:57:42,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:57:42,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:57:42,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:57:42,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:42,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:42,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:57:42,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:57:42,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:57:42,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:57:42,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:57:42,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:57:42,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:57:42,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:57:42,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:57:42,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:57:42,793 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 -> 5a8db184ab7332ab7843787a030506038544a962a60c0b43f4b663ada8e12be3 [2025-01-09 05:57:43,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:57:43,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:57:43,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:57:43,057 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:57:43,057 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:57:43,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2025-01-09 05:57:44,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2efb8f455/0fe7a727a3e74bb8b4c9fe9d3ac94cf3/FLAGfdf01cbea [2025-01-09 05:57:44,859 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:57:44,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2025-01-09 05:57:44,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2efb8f455/0fe7a727a3e74bb8b4c9fe9d3ac94cf3/FLAGfdf01cbea [2025-01-09 05:57:44,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2efb8f455/0fe7a727a3e74bb8b4c9fe9d3ac94cf3 [2025-01-09 05:57:44,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:57:44,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:57:44,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:57:44,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:57:44,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:57:44,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:57:44" (1/1) ... [2025-01-09 05:57:44,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14187ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:44, skipping insertion in model container [2025-01-09 05:57:44,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:57:44" (1/1) ... [2025-01-09 05:57:44,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:57:45,345 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[20426,20439] [2025-01-09 05:57:45,381 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[23243,23256] [2025-01-09 05:57:45,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:57:45,784 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:57:45,820 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[20426,20439] [2025-01-09 05:57:45,823 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[23243,23256] [2025-01-09 05:57:46,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:57:46,094 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:57:46,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46 WrapperNode [2025-01-09 05:57:46,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:57:46,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:57:46,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:57:46,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:57:46,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,512 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5215 [2025-01-09 05:57:46,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:57:46,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:57:46,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:57:46,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:57:46,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:57:46,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:57:46,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:57:46,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:57:46,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:57:46,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (1/1) ... [2025-01-09 05:57:46,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:57:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:57:46,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:57:47,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:57:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:57:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:57:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:57:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:57:47,115 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:57:47,116 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:57:50,711 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-09 05:57:50,712 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:57:50,733 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:57:50,734 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:57:50,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:57:50 BoogieIcfgContainer [2025-01-09 05:57:50,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:57:50,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:57:50,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:57:50,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:57:50,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:57:44" (1/3) ... [2025-01-09 05:57:50,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:57:50, skipping insertion in model container [2025-01-09 05:57:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:57:46" (2/3) ... [2025-01-09 05:57:50,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:57:50, skipping insertion in model container [2025-01-09 05:57:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:57:50" (3/3) ... [2025-01-09 05:57:50,741 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2025-01-09 05:57:50,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:57:50,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c that has 1 procedures, 929 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:57:50,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:57:50,809 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;@48d15756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:57:50,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:57:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 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-01-09 05:57:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:57:50,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:50,819 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] [2025-01-09 05:57:50,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:50,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash 751202448, now seen corresponding path program 1 times [2025-01-09 05:57:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:50,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981472096] [2025-01-09 05:57:50,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:57:50,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:57:50,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:50,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:51,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981472096] [2025-01-09 05:57:51,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981472096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:51,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:51,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:57:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819276166] [2025-01-09 05:57:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:51,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:51,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:51,022 INFO L87 Difference]: Start difference. First operand has 929 states, 926 states have (on average 1.9028077753779697) internal successors, (1762), 928 states have internal predecessors, (1762), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-01-09 05:57:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:54,278 INFO L93 Difference]: Finished difference Result 2573 states and 4933 transitions. [2025-01-09 05:57:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:54,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2025-01-09 05:57:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:54,294 INFO L225 Difference]: With dead ends: 2573 [2025-01-09 05:57:54,295 INFO L226 Difference]: Without dead ends: 1615 [2025-01-09 05:57:54,299 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-01-09 05:57:54,301 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 992 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:54,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 722 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 05:57:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-01-09 05:57:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-01-09 05:57:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6187228766274024) internal successors, (2611), 1614 states have internal predecessors, (2611), 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-01-09 05:57:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2611 transitions. [2025-01-09 05:57:54,373 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2611 transitions. Word has length 24 [2025-01-09 05:57:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:54,374 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2611 transitions. [2025-01-09 05:57:54,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-01-09 05:57:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2611 transitions. [2025-01-09 05:57:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:57:54,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:54,375 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] [2025-01-09 05:57:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:57:54,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 679590355, now seen corresponding path program 1 times [2025-01-09 05:57:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992532310] [2025-01-09 05:57:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:54,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:57:54,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:57:54,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:54,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992532310] [2025-01-09 05:57:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992532310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:54,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:57:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760133012] [2025-01-09 05:57:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:54,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:57:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:54,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:57:54,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:57:54,601 INFO L87 Difference]: Start difference. First operand 1615 states and 2611 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-01-09 05:57:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:54,665 INFO L93 Difference]: Finished difference Result 1673 states and 2702 transitions. [2025-01-09 05:57:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:57:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-01-09 05:57:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:54,670 INFO L225 Difference]: With dead ends: 1673 [2025-01-09 05:57:54,670 INFO L226 Difference]: Without dead ends: 1615 [2025-01-09 05:57:54,671 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-01-09 05:57:54,672 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:54,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-01-09 05:57:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2025-01-09 05:57:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.5877247365158091) internal successors, (2561), 1614 states have internal predecessors, (2561), 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-01-09 05:57:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2561 transitions. [2025-01-09 05:57:54,749 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2561 transitions. Word has length 28 [2025-01-09 05:57:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:54,750 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2561 transitions. [2025-01-09 05:57:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-01-09 05:57:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2561 transitions. [2025-01-09 05:57:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:57:54,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:54,755 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] [2025-01-09 05:57:54,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:57:54,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:54,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash -620307086, now seen corresponding path program 1 times [2025-01-09 05:57:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192879861] [2025-01-09 05:57:54,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:57:54,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:57:54,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:54,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192879861] [2025-01-09 05:57:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192879861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551178682] [2025-01-09 05:57:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:55,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:55,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:55,057 INFO L87 Difference]: Start difference. First operand 1615 states and 2561 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-01-09 05:57:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:55,365 INFO L93 Difference]: Finished difference Result 2371 states and 3779 transitions. [2025-01-09 05:57:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:57:55,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 77 [2025-01-09 05:57:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:55,374 INFO L225 Difference]: With dead ends: 2371 [2025-01-09 05:57:55,375 INFO L226 Difference]: Without dead ends: 2317 [2025-01-09 05:57:55,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:57:55,378 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11506 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11506 SdHoareTripleChecker+Valid, 4711 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:55,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11506 Valid, 4711 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-01-09 05:57:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1667. [2025-01-09 05:57:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.5885885885885886) internal successors, (2645), 1666 states have internal predecessors, (2645), 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-01-09 05:57:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2645 transitions. [2025-01-09 05:57:55,412 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2645 transitions. Word has length 77 [2025-01-09 05:57:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:55,413 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2645 transitions. [2025-01-09 05:57:55,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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-01-09 05:57:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2645 transitions. [2025-01-09 05:57:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:57:55,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:55,416 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] [2025-01-09 05:57:55,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:57:55,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:55,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -530347134, now seen corresponding path program 1 times [2025-01-09 05:57:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847037269] [2025-01-09 05:57:55,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:55,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:57:55,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:57:55,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:55,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:55,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:55,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847037269] [2025-01-09 05:57:55,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847037269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:55,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:55,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710166394] [2025-01-09 05:57:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:55,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:55,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:55,559 INFO L87 Difference]: Start difference. First operand 1667 states and 2645 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-09 05:57:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:55,588 INFO L93 Difference]: Finished difference Result 1868 states and 2968 transitions. [2025-01-09 05:57:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:55,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-01-09 05:57:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:55,596 INFO L225 Difference]: With dead ends: 1868 [2025-01-09 05:57:55,596 INFO L226 Difference]: Without dead ends: 1762 [2025-01-09 05:57:55,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:55,597 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 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-01-09 05:57:55,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-01-09 05:57:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-01-09 05:57:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.5887372013651877) internal successors, (2793), 1759 states have internal predecessors, (2793), 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-01-09 05:57:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2793 transitions. [2025-01-09 05:57:55,627 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2793 transitions. Word has length 79 [2025-01-09 05:57:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:55,627 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2793 transitions. [2025-01-09 05:57:55,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-01-09 05:57:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2793 transitions. [2025-01-09 05:57:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:57:55,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:55,629 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] [2025-01-09 05:57:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:57:55,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash -463853622, now seen corresponding path program 1 times [2025-01-09 05:57:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201369858] [2025-01-09 05:57:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:57:55,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:57:55,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:55,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:55,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201369858] [2025-01-09 05:57:55,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201369858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:55,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:57:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929150637] [2025-01-09 05:57:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:57:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:55,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:57:55,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:57:55,956 INFO L87 Difference]: Start difference. First operand 1760 states and 2793 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-01-09 05:57:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:56,281 INFO L93 Difference]: Finished difference Result 1961 states and 3113 transitions. [2025-01-09 05:57:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:57:56,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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 79 [2025-01-09 05:57:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:56,288 INFO L225 Difference]: With dead ends: 1961 [2025-01-09 05:57:56,288 INFO L226 Difference]: Without dead ends: 1762 [2025-01-09 05:57:56,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:57:56,289 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 1559 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:57:56,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 2168 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:57:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-01-09 05:57:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1760. [2025-01-09 05:57:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1758 states have (on average 1.587599544937429) internal successors, (2791), 1759 states have internal predecessors, (2791), 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-01-09 05:57:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2791 transitions. [2025-01-09 05:57:56,321 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2791 transitions. Word has length 79 [2025-01-09 05:57:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2791 transitions. [2025-01-09 05:57:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-01-09 05:57:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2791 transitions. [2025-01-09 05:57:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:57:56,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:56,322 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] [2025-01-09 05:57:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:57:56,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1909283312, now seen corresponding path program 1 times [2025-01-09 05:57:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898572199] [2025-01-09 05:57:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:56,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:57:56,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:57:56,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:56,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:56,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898572199] [2025-01-09 05:57:56,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898572199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:57:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443118997] [2025-01-09 05:57:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:56,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:57:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:56,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:57:56,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:57:56,650 INFO L87 Difference]: Start difference. First operand 1760 states and 2791 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-01-09 05:57:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:56,705 INFO L93 Difference]: Finished difference Result 1768 states and 2800 transitions. [2025-01-09 05:57:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:57:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 80 [2025-01-09 05:57:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:56,711 INFO L225 Difference]: With dead ends: 1768 [2025-01-09 05:57:56,711 INFO L226 Difference]: Without dead ends: 1766 [2025-01-09 05:57:56,712 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-01-09 05:57:56,712 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 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-01-09 05:57:56,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-01-09 05:57:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-01-09 05:57:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.5850340136054422) internal successors, (2796), 1765 states have internal predecessors, (2796), 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-01-09 05:57:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2796 transitions. [2025-01-09 05:57:56,743 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2796 transitions. Word has length 80 [2025-01-09 05:57:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2796 transitions. [2025-01-09 05:57:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-01-09 05:57:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2796 transitions. [2025-01-09 05:57:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:56,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:56,744 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] [2025-01-09 05:57:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:57:56,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -789777814, now seen corresponding path program 1 times [2025-01-09 05:57:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871932516] [2025-01-09 05:57:56,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:56,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:56,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:56,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871932516] [2025-01-09 05:57:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871932516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:56,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800897296] [2025-01-09 05:57:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:56,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:56,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:56,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:56,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:56,805 INFO L87 Difference]: Start difference. First operand 1766 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:56,829 INFO L93 Difference]: Finished difference Result 1984 states and 3137 transitions. [2025-01-09 05:57:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:56,835 INFO L225 Difference]: With dead ends: 1984 [2025-01-09 05:57:56,836 INFO L226 Difference]: Without dead ends: 1872 [2025-01-09 05:57:56,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:56,837 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 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-01-09 05:57:56,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-01-09 05:57:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1870. [2025-01-09 05:57:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1868 states have (on average 1.5829764453961457) internal successors, (2957), 1869 states have internal predecessors, (2957), 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-01-09 05:57:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2957 transitions. [2025-01-09 05:57:56,868 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2957 transitions. Word has length 81 [2025-01-09 05:57:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:56,868 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2957 transitions. [2025-01-09 05:57:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2957 transitions. [2025-01-09 05:57:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:56,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:56,869 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] [2025-01-09 05:57:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:57:56,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1315206250, now seen corresponding path program 1 times [2025-01-09 05:57:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927559269] [2025-01-09 05:57:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:56,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:56,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:56,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927559269] [2025-01-09 05:57:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927559269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519414606] [2025-01-09 05:57:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:56,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:56,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:56,964 INFO L87 Difference]: Start difference. First operand 1870 states and 2957 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:56,991 INFO L93 Difference]: Finished difference Result 2460 states and 3877 transitions. [2025-01-09 05:57:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:56,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:56,998 INFO L225 Difference]: With dead ends: 2460 [2025-01-09 05:57:56,998 INFO L226 Difference]: Without dead ends: 2153 [2025-01-09 05:57:56,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:56,999 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1742 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-01-09 05:57:56,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-01-09 05:57:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 2151. [2025-01-09 05:57:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2149 states have (on average 1.577012563983248) internal successors, (3389), 2150 states have internal predecessors, (3389), 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-01-09 05:57:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3389 transitions. [2025-01-09 05:57:57,036 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 3389 transitions. Word has length 81 [2025-01-09 05:57:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:57,036 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 3389 transitions. [2025-01-09 05:57:57,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 3389 transitions. [2025-01-09 05:57:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:57,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:57,037 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] [2025-01-09 05:57:57,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:57:57,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:57,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1579062634, now seen corresponding path program 1 times [2025-01-09 05:57:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:57,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822205455] [2025-01-09 05:57:57,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:57,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822205455] [2025-01-09 05:57:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822205455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:57,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:57,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315104130] [2025-01-09 05:57:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:57,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:57,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:57,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,089 INFO L87 Difference]: Start difference. First operand 2151 states and 3389 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:57,119 INFO L93 Difference]: Finished difference Result 3279 states and 5131 transitions. [2025-01-09 05:57:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:57,127 INFO L225 Difference]: With dead ends: 3279 [2025-01-09 05:57:57,128 INFO L226 Difference]: Without dead ends: 2691 [2025-01-09 05:57:57,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,129 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1744 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-01-09 05:57:57,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1744 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-01-09 05:57:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2689. [2025-01-09 05:57:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2687 states have (on average 1.5649423148492743) internal successors, (4205), 2688 states have internal predecessors, (4205), 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-01-09 05:57:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4205 transitions. [2025-01-09 05:57:57,177 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4205 transitions. Word has length 81 [2025-01-09 05:57:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:57,177 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4205 transitions. [2025-01-09 05:57:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4205 transitions. [2025-01-09 05:57:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:57,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:57,178 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] [2025-01-09 05:57:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:57:57,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:57,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1477642646, now seen corresponding path program 1 times [2025-01-09 05:57:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946284732] [2025-01-09 05:57:57,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:57,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946284732] [2025-01-09 05:57:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946284732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:57,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35508170] [2025-01-09 05:57:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:57,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:57,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:57,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,228 INFO L87 Difference]: Start difference. First operand 2689 states and 4205 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:57,268 INFO L93 Difference]: Finished difference Result 4845 states and 7495 transitions. [2025-01-09 05:57:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:57,280 INFO L225 Difference]: With dead ends: 4845 [2025-01-09 05:57:57,280 INFO L226 Difference]: Without dead ends: 3719 [2025-01-09 05:57:57,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,282 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1746 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-01-09 05:57:57,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1746 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-01-09 05:57:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2025-01-09 05:57:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3715 states have (on average 1.5453566621803498) internal successors, (5741), 3716 states have internal predecessors, (5741), 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-01-09 05:57:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5741 transitions. [2025-01-09 05:57:57,351 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5741 transitions. Word has length 81 [2025-01-09 05:57:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:57,351 INFO L471 AbstractCegarLoop]: Abstraction has 3717 states and 5741 transitions. [2025-01-09 05:57:57,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5741 transitions. [2025-01-09 05:57:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:57,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:57,353 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] [2025-01-09 05:57:57,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:57:57,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 601855850, now seen corresponding path program 1 times [2025-01-09 05:57:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112508395] [2025-01-09 05:57:57,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:57,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:57,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:57,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:57,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112508395] [2025-01-09 05:57:57,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112508395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:57,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:57,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676562838] [2025-01-09 05:57:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:57,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:57,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:57,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,400 INFO L87 Difference]: Start difference. First operand 3717 states and 5741 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:57,523 INFO L93 Difference]: Finished difference Result 7833 states and 11935 transitions. [2025-01-09 05:57:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:57,540 INFO L225 Difference]: With dead ends: 7833 [2025-01-09 05:57:57,540 INFO L226 Difference]: Without dead ends: 5679 [2025-01-09 05:57:57,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,544 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1748 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-01-09 05:57:57,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2025-01-09 05:57:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 5677. [2025-01-09 05:57:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5675 states have (on average 1.5191189427312775) internal successors, (8621), 5676 states have internal predecessors, (8621), 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-01-09 05:57:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 8621 transitions. [2025-01-09 05:57:57,687 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 8621 transitions. Word has length 81 [2025-01-09 05:57:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:57,687 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 8621 transitions. [2025-01-09 05:57:57,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 8621 transitions. [2025-01-09 05:57:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:57,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:57,688 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] [2025-01-09 05:57:57,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:57:57,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1912178582, now seen corresponding path program 1 times [2025-01-09 05:57:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885911448] [2025-01-09 05:57:57,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:57,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:57,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:57,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:57,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885911448] [2025-01-09 05:57:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885911448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327219757] [2025-01-09 05:57:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:57,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:57,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:57,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,747 INFO L87 Difference]: Start difference. First operand 5677 states and 8621 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:57,885 INFO L93 Difference]: Finished difference Result 13521 states and 20239 transitions. [2025-01-09 05:57:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:57,902 INFO L225 Difference]: With dead ends: 13521 [2025-01-09 05:57:57,903 INFO L226 Difference]: Without dead ends: 9407 [2025-01-09 05:57:57,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:57,910 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1750 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-01-09 05:57:57,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9407 states. [2025-01-09 05:57:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9407 to 9405. [2025-01-09 05:57:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9405 states, 9403 states have (on average 1.48856747846432) internal successors, (13997), 9404 states have internal predecessors, (13997), 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-01-09 05:57:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9405 states to 9405 states and 13997 transitions. [2025-01-09 05:57:58,123 INFO L78 Accepts]: Start accepts. Automaton has 9405 states and 13997 transitions. Word has length 81 [2025-01-09 05:57:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:58,123 INFO L471 AbstractCegarLoop]: Abstraction has 9405 states and 13997 transitions. [2025-01-09 05:57:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9405 states and 13997 transitions. [2025-01-09 05:57:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:57:58,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:58,125 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] [2025-01-09 05:57:58,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:57:58,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:58,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1152291690, now seen corresponding path program 1 times [2025-01-09 05:57:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167992678] [2025-01-09 05:57:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:58,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:57:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:57:58,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167992678] [2025-01-09 05:57:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167992678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:58,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:57:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026842558] [2025-01-09 05:57:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:58,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:58,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:58,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:58,182 INFO L87 Difference]: Start difference. First operand 9405 states and 13997 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:57:58,452 INFO L93 Difference]: Finished difference Result 24321 states and 35695 transitions. [2025-01-09 05:57:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:57:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-09 05:57:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:57:58,480 INFO L225 Difference]: With dead ends: 24321 [2025-01-09 05:57:58,481 INFO L226 Difference]: Without dead ends: 16479 [2025-01-09 05:57:58,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:58,490 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 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-01-09 05:57:58,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:57:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16479 states. [2025-01-09 05:57:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16479 to 16477. [2025-01-09 05:57:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16477 states, 16475 states have (on average 1.4555993930197269) internal successors, (23981), 16476 states have internal predecessors, (23981), 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-01-09 05:57:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16477 states to 16477 states and 23981 transitions. [2025-01-09 05:57:58,813 INFO L78 Accepts]: Start accepts. Automaton has 16477 states and 23981 transitions. Word has length 81 [2025-01-09 05:57:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:57:58,813 INFO L471 AbstractCegarLoop]: Abstraction has 16477 states and 23981 transitions. [2025-01-09 05:57:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-01-09 05:57:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 16477 states and 23981 transitions. [2025-01-09 05:57:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:57:58,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:57:58,816 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-01-09 05:57:58,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:57:58,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:57:58,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:57:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1681076652, now seen corresponding path program 1 times [2025-01-09 05:57:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:57:58,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758210603] [2025-01-09 05:57:58,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:57:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:57:58,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:57:58,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:57:58,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:57:58,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:57:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:57:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:57:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758210603] [2025-01-09 05:57:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758210603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:57:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:57:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:57:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836173505] [2025-01-09 05:57:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:57:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:57:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:57:58,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:57:58,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:57:58,875 INFO L87 Difference]: Start difference. First operand 16477 states and 23981 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-01-09 05:58:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:01,510 INFO L93 Difference]: Finished difference Result 19485 states and 28813 transitions. [2025-01-09 05:58:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:01,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2025-01-09 05:58:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:01,539 INFO L225 Difference]: With dead ends: 19485 [2025-01-09 05:58:01,540 INFO L226 Difference]: Without dead ends: 17981 [2025-01-09 05:58:01,545 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-01-09 05:58:01,546 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1058 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:01,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 726 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 05:58:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17981 states. [2025-01-09 05:58:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17981 to 17979. [2025-01-09 05:58:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17979 states, 17977 states have (on average 1.4436224064081882) internal successors, (25952), 17978 states have internal predecessors, (25952), 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-01-09 05:58:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 25952 transitions. [2025-01-09 05:58:01,880 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 25952 transitions. Word has length 99 [2025-01-09 05:58:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:01,881 INFO L471 AbstractCegarLoop]: Abstraction has 17979 states and 25952 transitions. [2025-01-09 05:58:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-01-09 05:58:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 25952 transitions. [2025-01-09 05:58:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:01,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:01,886 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:58:01,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1255535689, now seen corresponding path program 1 times [2025-01-09 05:58:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211107278] [2025-01-09 05:58:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:01,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:01,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:01,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:58:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211107278] [2025-01-09 05:58:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211107278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623941993] [2025-01-09 05:58:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:02,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:02,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:02,145 INFO L87 Difference]: Start difference. First operand 17979 states and 25952 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-01-09 05:58:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:03,858 INFO L93 Difference]: Finished difference Result 121035 states and 174440 transitions. [2025-01-09 05:58:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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 104 [2025-01-09 05:58:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:04,295 INFO L225 Difference]: With dead ends: 121035 [2025-01-09 05:58:04,295 INFO L226 Difference]: Without dead ends: 110537 [2025-01-09 05:58:04,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:04,332 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9795 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:04,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 4478 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110537 states. [2025-01-09 05:58:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110537 to 30715. [2025-01-09 05:58:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30715 states, 30713 states have (on average 1.4367857259141081) internal successors, (44128), 30714 states have internal predecessors, (44128), 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-01-09 05:58:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30715 states to 30715 states and 44128 transitions. [2025-01-09 05:58:05,744 INFO L78 Accepts]: Start accepts. Automaton has 30715 states and 44128 transitions. Word has length 104 [2025-01-09 05:58:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:05,744 INFO L471 AbstractCegarLoop]: Abstraction has 30715 states and 44128 transitions. [2025-01-09 05:58:05,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-01-09 05:58:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30715 states and 44128 transitions. [2025-01-09 05:58:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:05,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:05,750 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:05,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:58:05,750 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:05,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash -934447543, now seen corresponding path program 1 times [2025-01-09 05:58:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117738381] [2025-01-09 05:58:05,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:05,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:58:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117738381] [2025-01-09 05:58:06,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117738381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:06,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108871465] [2025-01-09 05:58:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:06,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:06,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:06,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:06,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:06,017 INFO L87 Difference]: Start difference. First operand 30715 states and 44128 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-01-09 05:58:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:08,237 INFO L93 Difference]: Finished difference Result 135947 states and 195816 transitions. [2025-01-09 05:58:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:08,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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 104 [2025-01-09 05:58:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:08,417 INFO L225 Difference]: With dead ends: 135947 [2025-01-09 05:58:08,417 INFO L226 Difference]: Without dead ends: 121033 [2025-01-09 05:58:08,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:08,452 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9859 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9859 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:08,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9859 Valid, 4557 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121033 states. [2025-01-09 05:58:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121033 to 50875. [2025-01-09 05:58:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50875 states, 50873 states have (on average 1.4322725217698975) internal successors, (72864), 50874 states have internal predecessors, (72864), 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-01-09 05:58:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50875 states to 50875 states and 72864 transitions. [2025-01-09 05:58:10,153 INFO L78 Accepts]: Start accepts. Automaton has 50875 states and 72864 transitions. Word has length 104 [2025-01-09 05:58:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:10,153 INFO L471 AbstractCegarLoop]: Abstraction has 50875 states and 72864 transitions. [2025-01-09 05:58:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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-01-09 05:58:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 50875 states and 72864 transitions. [2025-01-09 05:58:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:10,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:10,159 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:58:10,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:10,161 INFO L85 PathProgramCache]: Analyzing trace with hash -670591159, now seen corresponding path program 1 times [2025-01-09 05:58:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:10,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66918807] [2025-01-09 05:58:10,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:10,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:10,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:10,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:10,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:10,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:58:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66918807] [2025-01-09 05:58:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66918807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316280731] [2025-01-09 05:58:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:10,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:10,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:10,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:10,312 INFO L87 Difference]: Start difference. First operand 50875 states and 72864 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-01-09 05:58:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:12,896 INFO L93 Difference]: Finished difference Result 150859 states and 217128 transitions. [2025-01-09 05:58:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:12,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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 104 [2025-01-09 05:58:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:13,210 INFO L225 Difference]: With dead ends: 150859 [2025-01-09 05:58:13,214 INFO L226 Difference]: Without dead ends: 135945 [2025-01-09 05:58:13,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:13,296 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9905 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9905 SdHoareTripleChecker+Valid, 4448 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9905 Valid, 4448 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135945 states. [2025-01-09 05:58:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135945 to 65787. [2025-01-09 05:58:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65787 states, 65785 states have (on average 1.4315725469331915) internal successors, (94176), 65786 states have internal predecessors, (94176), 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-01-09 05:58:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65787 states to 65787 states and 94176 transitions. [2025-01-09 05:58:15,296 INFO L78 Accepts]: Start accepts. Automaton has 65787 states and 94176 transitions. Word has length 104 [2025-01-09 05:58:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 65787 states and 94176 transitions. [2025-01-09 05:58:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 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-01-09 05:58:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 65787 states and 94176 transitions. [2025-01-09 05:58:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:15,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:15,311 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:58:15,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:15,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash 567670857, now seen corresponding path program 1 times [2025-01-09 05:58:15,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:15,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028249675] [2025-01-09 05:58:15,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:15,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:15,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:15,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:58:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028249675] [2025-01-09 05:58:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028249675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185330796] [2025-01-09 05:58:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:15,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:15,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:15,550 INFO L87 Difference]: Start difference. First operand 65787 states and 94176 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-01-09 05:58:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:18,441 INFO L93 Difference]: Finished difference Result 165771 states and 238440 transitions. [2025-01-09 05:58:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 104 [2025-01-09 05:58:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:18,671 INFO L225 Difference]: With dead ends: 165771 [2025-01-09 05:58:18,671 INFO L226 Difference]: Without dead ends: 150857 [2025-01-09 05:58:18,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:18,711 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9954 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9954 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:18,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9954 Valid, 4389 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150857 states. [2025-01-09 05:58:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150857 to 80699. [2025-01-09 05:58:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80699 states, 80697 states have (on average 1.4311312688204023) internal successors, (115488), 80698 states have internal predecessors, (115488), 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-01-09 05:58:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80699 states to 80699 states and 115488 transitions. [2025-01-09 05:58:21,391 INFO L78 Accepts]: Start accepts. Automaton has 80699 states and 115488 transitions. Word has length 104 [2025-01-09 05:58:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 80699 states and 115488 transitions. [2025-01-09 05:58:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-01-09 05:58:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 80699 states and 115488 transitions. [2025-01-09 05:58:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:21,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:21,409 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:21,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:58:21,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:21,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:21,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1647797943, now seen corresponding path program 1 times [2025-01-09 05:58:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405987906] [2025-01-09 05:58:21,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:21,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:21,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:21,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:58:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405987906] [2025-01-09 05:58:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405987906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952498951] [2025-01-09 05:58:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:21,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:21,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:21,627 INFO L87 Difference]: Start difference. First operand 80699 states and 115488 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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-01-09 05:58:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:25,248 INFO L93 Difference]: Finished difference Result 180683 states and 259752 transitions. [2025-01-09 05:58:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 104 [2025-01-09 05:58:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:25,502 INFO L225 Difference]: With dead ends: 180683 [2025-01-09 05:58:25,503 INFO L226 Difference]: Without dead ends: 165769 [2025-01-09 05:58:25,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:25,545 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 10010 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10010 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:25,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10010 Valid, 4417 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165769 states. [2025-01-09 05:58:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165769 to 95611. [2025-01-09 05:58:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95611 states, 95609 states have (on average 1.4308276417492076) internal successors, (136800), 95610 states have internal predecessors, (136800), 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-01-09 05:58:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95611 states to 95611 states and 136800 transitions. [2025-01-09 05:58:28,706 INFO L78 Accepts]: Start accepts. Automaton has 95611 states and 136800 transitions. Word has length 104 [2025-01-09 05:58:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 95611 states and 136800 transitions. [2025-01-09 05:58:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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-01-09 05:58:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 95611 states and 136800 transitions. [2025-01-09 05:58:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:28,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:28,712 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:28,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:58:28,713 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:28,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash 133134921, now seen corresponding path program 1 times [2025-01-09 05:58:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360668654] [2025-01-09 05:58:28,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:28,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:58:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:28,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360668654] [2025-01-09 05:58:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360668654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238951959] [2025-01-09 05:58:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:28,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:28,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:28,847 INFO L87 Difference]: Start difference. First operand 95611 states and 136800 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-01-09 05:58:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:32,265 INFO L93 Difference]: Finished difference Result 195595 states and 281064 transitions. [2025-01-09 05:58:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:32,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 104 [2025-01-09 05:58:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:32,518 INFO L225 Difference]: With dead ends: 195595 [2025-01-09 05:58:32,518 INFO L226 Difference]: Without dead ends: 180681 [2025-01-09 05:58:32,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:58:32,594 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 9875 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9875 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:32,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9875 Valid, 4538 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180681 states. [2025-01-09 05:58:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180681 to 110523. [2025-01-09 05:58:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110523 states, 110521 states have (on average 1.4306059481908415) internal successors, (158112), 110522 states have internal predecessors, (158112), 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-01-09 05:58:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110523 states to 110523 states and 158112 transitions. [2025-01-09 05:58:36,810 INFO L78 Accepts]: Start accepts. Automaton has 110523 states and 158112 transitions. Word has length 104 [2025-01-09 05:58:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 110523 states and 158112 transitions. [2025-01-09 05:58:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-01-09 05:58:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 110523 states and 158112 transitions. [2025-01-09 05:58:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:58:36,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:36,819 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:36,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:58:36,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:36,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1097362103, now seen corresponding path program 1 times [2025-01-09 05:58:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574210249] [2025-01-09 05:58:36,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:36,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:58:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:58:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:58:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:36,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574210249] [2025-01-09 05:58:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574210249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:36,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:36,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024421524] [2025-01-09 05:58:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:36,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:36,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:36,955 INFO L87 Difference]: Start difference. First operand 110523 states and 158112 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 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)