./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6c5b756d724a9cd5d9c89c4b12a854260c3278a67df891fb3233689095aa59ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:21:02,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:21:02,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:21:02,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:21:02,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:21:02,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:21:02,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:21:02,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:21:02,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:21:02,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:21:02,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:21:02,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:21:02,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:21:02,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:21:02,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:21:02,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:21:02,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:21:02,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:21:02,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:21:02,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:21:02,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:21:02,877 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/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 -> 6c5b756d724a9cd5d9c89c4b12a854260c3278a67df891fb3233689095aa59ca [2025-03-08 06:21:03,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:21:03,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:21:03,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:21:03,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:21:03,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:21:03,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-03-08 06:21:04,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b338b234/e34e3cb595b84a76b5fd56a3ff8452d0/FLAG2df0ac369 [2025-03-08 06:21:04,495 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:21:04,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-03-08 06:21:04,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b338b234/e34e3cb595b84a76b5fd56a3ff8452d0/FLAG2df0ac369 [2025-03-08 06:21:04,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b338b234/e34e3cb595b84a76b5fd56a3ff8452d0 [2025-03-08 06:21:04,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:21:04,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:21:04,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:21:04,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:21:04,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:21:04,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:21:04" (1/1) ... [2025-03-08 06:21:04,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:04, skipping insertion in model container [2025-03-08 06:21:04,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:21:04" (1/1) ... [2025-03-08 06:21:04,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:21:04,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[6320,6333] [2025-03-08 06:21:05,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:21:05,031 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:21:05,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[6320,6333] [2025-03-08 06:21:05,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:21:05,126 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:21:05,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05 WrapperNode [2025-03-08 06:21:05,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:21:05,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:21:05,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:21:05,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:21:05,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,172 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 577 [2025-03-08 06:21:05,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:21:05,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:21:05,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:21:05,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:21:05,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,210 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-03-08 06:21:05,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:21:05,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:21:05,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:21:05,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:21:05,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (1/1) ... [2025-03-08 06:21:05,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:21:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:21:05,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:21:05,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:21:05,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:21:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:21:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:21:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:21:05,374 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:21:05,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:21:05,756 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L250: havoc main_~node4__m4~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L268: havoc main_~node5__m5~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L487: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L195: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: havoc main_~node2__m2~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L232: havoc main_~node3__m3~0#1; [2025-03-08 06:21:05,757 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-08 06:21:05,781 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-08 06:21:05,782 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:21:05,791 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:21:05,791 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:21:05,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:21:05 BoogieIcfgContainer [2025-03-08 06:21:05,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:21:05,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:21:05,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:21:05,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:21:05,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:21:04" (1/3) ... [2025-03-08 06:21:05,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:21:05, skipping insertion in model container [2025-03-08 06:21:05,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:21:05" (2/3) ... [2025-03-08 06:21:05,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728b6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:21:05, skipping insertion in model container [2025-03-08 06:21:05,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:21:05" (3/3) ... [2025-03-08 06:21:05,798 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2025-03-08 06:21:05,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:21:05,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c that has 1 procedures, 136 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:21:05,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:21:05,860 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;@6768d9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:21:05,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:21:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 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-03-08 06:21:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:21:05,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:05,867 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] [2025-03-08 06:21:05,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1433413237, now seen corresponding path program 1 times [2025-03-08 06:21:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 06:21:05,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:05,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:21:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:21:06,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 06:21:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150275916] [2025-03-08 06:21:06,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:06,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:06,234 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7014925373134329) internal successors, (228), 135 states have internal predecessors, (228), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 06:21:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:06,291 INFO L93 Difference]: Finished difference Result 322 states and 522 transitions. [2025-03-08 06:21:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-03-08 06:21:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:06,299 INFO L225 Difference]: With dead ends: 322 [2025-03-08 06:21:06,300 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 06:21:06,302 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-03-08 06:21:06,327 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 174 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 504 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 06:21:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2025-03-08 06:21:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.5047169811320755) internal successors, (319), 212 states have internal predecessors, (319), 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-03-08 06:21:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 319 transitions. [2025-03-08 06:21:06,367 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 319 transitions. Word has length 60 [2025-03-08 06:21:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,367 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 319 transitions. [2025-03-08 06:21:06,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-08 06:21:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 319 transitions. [2025-03-08 06:21:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 06:21:06,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,368 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] [2025-03-08 06:21:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:21:06,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1986010908, now seen corresponding path program 1 times [2025-03-08 06:21:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-03-08 06:21:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:21:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:21:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-03-08 06:21:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031932003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627330665] [2025-03-08 06:21:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:06,495 INFO L87 Difference]: Start difference. First operand 213 states and 319 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03-08 06:21:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:06,527 INFO L93 Difference]: Finished difference Result 537 states and 835 transitions. [2025-03-08 06:21:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2025-03-08 06:21:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:06,532 INFO L225 Difference]: With dead ends: 537 [2025-03-08 06:21:06,532 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 06:21:06,533 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-03-08 06:21:06,533 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 139 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:06,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 443 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 06:21:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2025-03-08 06:21:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.5393258426966292) internal successors, (548), 356 states have internal predecessors, (548), 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-03-08 06:21:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-03-08 06:21:06,559 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 61 [2025-03-08 06:21:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,559 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-03-08 06:21:06,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-03-08 06:21:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-03-08 06:21:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:21:06,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,560 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] [2025-03-08 06:21:06,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:21:06,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:06,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1573796305, now seen corresponding path program 1 times [2025-03-08 06:21:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273093991] [2025-03-08 06:21:06,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:21:06,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:21:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273093991] [2025-03-08 06:21:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273093991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490602829] [2025-03-08 06:21:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:06,670 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 06:21:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:06,695 INFO L93 Difference]: Finished difference Result 937 states and 1470 transitions. [2025-03-08 06:21:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-03-08 06:21:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:06,699 INFO L225 Difference]: With dead ends: 937 [2025-03-08 06:21:06,699 INFO L226 Difference]: Without dead ends: 615 [2025-03-08 06:21:06,702 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-03-08 06:21:06,702 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 134 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:06,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 428 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-08 06:21:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 613. [2025-03-08 06:21:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.5555555555555556) internal successors, (952), 612 states have internal predecessors, (952), 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-03-08 06:21:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 952 transitions. [2025-03-08 06:21:06,724 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 952 transitions. Word has length 62 [2025-03-08 06:21:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 952 transitions. [2025-03-08 06:21:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-08 06:21:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 952 transitions. [2025-03-08 06:21:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 06:21:06,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,726 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] [2025-03-08 06:21:06,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:21:06,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1874004310, now seen corresponding path program 1 times [2025-03-08 06:21:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945448958] [2025-03-08 06:21:06,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 06:21:06,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 06:21:06,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945448958] [2025-03-08 06:21:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945448958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575330627] [2025-03-08 06:21:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:06,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:06,821 INFO L87 Difference]: Start difference. First operand 613 states and 952 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-08 06:21:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:06,844 INFO L93 Difference]: Finished difference Result 1641 states and 2578 transitions. [2025-03-08 06:21:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-03-08 06:21:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:06,849 INFO L225 Difference]: With dead ends: 1641 [2025-03-08 06:21:06,849 INFO L226 Difference]: Without dead ends: 1063 [2025-03-08 06:21:06,850 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-03-08 06:21:06,851 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 129 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:06,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-08 06:21:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2025-03-08 06:21:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.558490566037736) internal successors, (1652), 1060 states have internal predecessors, (1652), 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-03-08 06:21:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1652 transitions. [2025-03-08 06:21:06,903 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1652 transitions. Word has length 63 [2025-03-08 06:21:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1652 transitions. [2025-03-08 06:21:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-08 06:21:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1652 transitions. [2025-03-08 06:21:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:21:06,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,905 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] [2025-03-08 06:21:06,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:21:06,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:06,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -317050903, now seen corresponding path program 1 times [2025-03-08 06:21:06,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90860252] [2025-03-08 06:21:06,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:21:06,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:21:06,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90860252] [2025-03-08 06:21:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90860252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:06,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196924727] [2025-03-08 06:21:06,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:06,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:06,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:06,988 INFO L87 Difference]: Start difference. First operand 1061 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-03-08 06:21:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:07,015 INFO L93 Difference]: Finished difference Result 2857 states and 4470 transitions. [2025-03-08 06:21:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2025-03-08 06:21:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:07,022 INFO L225 Difference]: With dead ends: 2857 [2025-03-08 06:21:07,023 INFO L226 Difference]: Without dead ends: 1831 [2025-03-08 06:21:07,024 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-03-08 06:21:07,025 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:07,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-08 06:21:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2025-03-08 06:21:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.5514223194748358) internal successors, (2836), 1828 states have internal predecessors, (2836), 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-03-08 06:21:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2836 transitions. [2025-03-08 06:21:07,058 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2836 transitions. Word has length 64 [2025-03-08 06:21:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:07,059 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2836 transitions. [2025-03-08 06:21:07,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-03-08 06:21:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2836 transitions. [2025-03-08 06:21:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:21:07,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:07,063 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] [2025-03-08 06:21:07,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:21:07,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:07,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:07,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1166040464, now seen corresponding path program 1 times [2025-03-08 06:21:07,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:07,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-03-08 06:21:07,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:21:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:21:07,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:07,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677211677] [2025-03-08 06:21:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677211677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:07,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476746792] [2025-03-08 06:21:07,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:07,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:07,250 INFO L87 Difference]: Start difference. First operand 1829 states and 2836 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-03-08 06:21:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:07,442 INFO L93 Difference]: Finished difference Result 12593 states and 19642 transitions. [2025-03-08 06:21:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:21:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-03-08 06:21:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:07,475 INFO L225 Difference]: With dead ends: 12593 [2025-03-08 06:21:07,476 INFO L226 Difference]: Without dead ends: 10799 [2025-03-08 06:21:07,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:21:07,483 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1450 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:07,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2379 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2025-03-08 06:21:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 3621. [2025-03-08 06:21:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3620 states have (on average 1.5392265193370165) internal successors, (5572), 3620 states have internal predecessors, (5572), 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-03-08 06:21:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 5572 transitions. [2025-03-08 06:21:07,619 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 5572 transitions. Word has length 65 [2025-03-08 06:21:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 5572 transitions. [2025-03-08 06:21:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-03-08 06:21:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 5572 transitions. [2025-03-08 06:21:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:21:07,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:07,621 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] [2025-03-08 06:21:07,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:21:07,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1788471385, now seen corresponding path program 1 times [2025-03-08 06:21:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43191984] [2025-03-08 06:21:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:07,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:21:07,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:21:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43191984] [2025-03-08 06:21:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43191984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550585763] [2025-03-08 06:21:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:07,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:07,831 INFO L87 Difference]: Start difference. First operand 3621 states and 5572 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-03-08 06:21:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:07,981 INFO L93 Difference]: Finished difference Result 18831 states and 28777 transitions. [2025-03-08 06:21:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:21:07,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2025-03-08 06:21:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:08,025 INFO L225 Difference]: With dead ends: 18831 [2025-03-08 06:21:08,028 INFO L226 Difference]: Without dead ends: 15245 [2025-03-08 06:21:08,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:08,039 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 706 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:08,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 929 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15245 states. [2025-03-08 06:21:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15245 to 15237. [2025-03-08 06:21:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15237 states, 15236 states have (on average 1.520871619847729) internal successors, (23172), 15236 states have internal predecessors, (23172), 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-03-08 06:21:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 23172 transitions. [2025-03-08 06:21:08,324 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 23172 transitions. Word has length 66 [2025-03-08 06:21:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:08,324 INFO L471 AbstractCegarLoop]: Abstraction has 15237 states and 23172 transitions. [2025-03-08 06:21:08,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-03-08 06:21:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 23172 transitions. [2025-03-08 06:21:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:21:08,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:08,325 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] [2025-03-08 06:21:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:21:08,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -606945545, now seen corresponding path program 1 times [2025-03-08 06:21:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:08,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481166122] [2025-03-08 06:21:08,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:21:08,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:21:08,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:08,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481166122] [2025-03-08 06:21:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481166122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:08,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:21:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058416617] [2025-03-08 06:21:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:08,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:21:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:21:08,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:21:08,616 INFO L87 Difference]: Start difference. First operand 15237 states and 23172 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 06:21:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:08,673 INFO L93 Difference]: Finished difference Result 15879 states and 24133 transitions. [2025-03-08 06:21:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:21:08,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2025-03-08 06:21:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:08,706 INFO L225 Difference]: With dead ends: 15879 [2025-03-08 06:21:08,706 INFO L226 Difference]: Without dead ends: 15877 [2025-03-08 06:21:08,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-08 06:21:08,715 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:08,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 741 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15877 states. [2025-03-08 06:21:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15877 to 15877. [2025-03-08 06:21:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.4998740236835475) internal successors, (23812), 15876 states have internal predecessors, (23812), 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-03-08 06:21:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 23812 transitions. [2025-03-08 06:21:08,994 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 23812 transitions. Word has length 68 [2025-03-08 06:21:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 15877 states and 23812 transitions. [2025-03-08 06:21:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-03-08 06:21:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 23812 transitions. [2025-03-08 06:21:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:21:08,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:08,996 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] [2025-03-08 06:21:08,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:21:08,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1630674094, now seen corresponding path program 1 times [2025-03-08 06:21:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-03-08 06:21:08,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:09,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:21:09,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:21:09,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:09,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-03-08 06:21:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006088574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954225] [2025-03-08 06:21:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:09,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:09,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:09,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:09,062 INFO L87 Difference]: Start difference. First operand 15877 states and 23812 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-08 06:21:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:09,161 INFO L93 Difference]: Finished difference Result 39035 states and 58568 transitions. [2025-03-08 06:21:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2025-03-08 06:21:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:09,198 INFO L225 Difference]: With dead ends: 39035 [2025-03-08 06:21:09,198 INFO L226 Difference]: Without dead ends: 23193 [2025-03-08 06:21:09,216 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-03-08 06:21:09,217 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 114 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:09,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 385 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23193 states. [2025-03-08 06:21:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23193 to 23191. [2025-03-08 06:21:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23191 states, 23190 states have (on average 1.4940060370849504) internal successors, (34646), 23190 states have internal predecessors, (34646), 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-03-08 06:21:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 34646 transitions. [2025-03-08 06:21:09,594 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 34646 transitions. Word has length 69 [2025-03-08 06:21:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:09,595 INFO L471 AbstractCegarLoop]: Abstraction has 23191 states and 34646 transitions. [2025-03-08 06:21:09,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-08 06:21:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 34646 transitions. [2025-03-08 06:21:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:21:09,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:09,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:21:09,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1317065051, now seen corresponding path program 1 times [2025-03-08 06:21:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:09,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051559174] [2025-03-08 06:21:09,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:09,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:21:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:21:09,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:09,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:21:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051559174] [2025-03-08 06:21:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051559174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:21:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603385717] [2025-03-08 06:21:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:09,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:21:09,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:21:09,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:21:09,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:21:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:21:09,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:21:09,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:09,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 06:21:09,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:21:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:10,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:21:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603385717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:21:11,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:21:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2025-03-08 06:21:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175682624] [2025-03-08 06:21:11,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:21:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 06:21:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:11,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 06:21:11,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:21:11,252 INFO L87 Difference]: Start difference. First operand 23191 states and 34646 transitions. Second operand has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 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-03-08 06:21:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:11,955 INFO L93 Difference]: Finished difference Result 81236 states and 121369 transitions. [2025-03-08 06:21:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:21:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:21:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:12,057 INFO L225 Difference]: With dead ends: 81236 [2025-03-08 06:21:12,057 INFO L226 Difference]: Without dead ends: 58082 [2025-03-08 06:21:12,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:21:12,080 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 3932 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3932 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:12,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3932 Valid, 1967 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:21:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58082 states. [2025-03-08 06:21:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58082 to 58058. [2025-03-08 06:21:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58058 states, 58057 states have (on average 1.480045472552836) internal successors, (85927), 58057 states have internal predecessors, (85927), 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-03-08 06:21:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58058 states to 58058 states and 85927 transitions. [2025-03-08 06:21:12,845 INFO L78 Accepts]: Start accepts. Automaton has 58058 states and 85927 transitions. Word has length 94 [2025-03-08 06:21:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:12,845 INFO L471 AbstractCegarLoop]: Abstraction has 58058 states and 85927 transitions. [2025-03-08 06:21:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.0) internal successors, (270), 15 states have internal predecessors, (270), 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-03-08 06:21:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 58058 states and 85927 transitions. [2025-03-08 06:21:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:12,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:12,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:12,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:21:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:21:13,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2138928861, now seen corresponding path program 1 times [2025-03-08 06:21:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-03-08 06:21:13,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:13,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:13,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:13,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:13,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:13,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:13,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296326692] [2025-03-08 06:21:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296326692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:13,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:13,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182856883] [2025-03-08 06:21:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:13,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:13,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:13,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:13,135 INFO L87 Difference]: Start difference. First operand 58058 states and 85927 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:13,434 INFO L93 Difference]: Finished difference Result 150739 states and 222767 transitions. [2025-03-08 06:21:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-08 06:21:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:13,591 INFO L225 Difference]: With dead ends: 150739 [2025-03-08 06:21:13,591 INFO L226 Difference]: Without dead ends: 101327 [2025-03-08 06:21:13,658 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-03-08 06:21:13,659 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 111 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:13,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 368 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101327 states. [2025-03-08 06:21:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101327 to 101325. [2025-03-08 06:21:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101325 states, 101324 states have (on average 1.4658817259484427) internal successors, (148529), 101324 states have internal predecessors, (148529), 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-03-08 06:21:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101325 states to 101325 states and 148529 transitions. [2025-03-08 06:21:15,078 INFO L78 Accepts]: Start accepts. Automaton has 101325 states and 148529 transitions. Word has length 95 [2025-03-08 06:21:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:15,078 INFO L471 AbstractCegarLoop]: Abstraction has 101325 states and 148529 transitions. [2025-03-08 06:21:15,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 101325 states and 148529 transitions. [2025-03-08 06:21:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:15,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:15,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:21:15,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:15,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1135308535, now seen corresponding path program 1 times [2025-03-08 06:21:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-08 06:21:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:15,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:15,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:15,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:15,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-08 06:21:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970521899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:15,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622609330] [2025-03-08 06:21:15,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:15,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:15,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:15,141 INFO L87 Difference]: Start difference. First operand 101325 states and 148529 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:15,979 INFO L93 Difference]: Finished difference Result 266138 states and 389008 transitions. [2025-03-08 06:21:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-08 06:21:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:16,503 INFO L225 Difference]: With dead ends: 266138 [2025-03-08 06:21:16,504 INFO L226 Difference]: Without dead ends: 173694 [2025-03-08 06:21:16,538 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-03-08 06:21:16,539 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 112 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173694 states. [2025-03-08 06:21:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173694 to 170528. [2025-03-08 06:21:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170528 states, 170527 states have (on average 1.4505386243820626) internal successors, (247356), 170527 states have internal predecessors, (247356), 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-03-08 06:21:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170528 states to 170528 states and 247356 transitions. [2025-03-08 06:21:18,869 INFO L78 Accepts]: Start accepts. Automaton has 170528 states and 247356 transitions. Word has length 95 [2025-03-08 06:21:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:18,869 INFO L471 AbstractCegarLoop]: Abstraction has 170528 states and 247356 transitions. [2025-03-08 06:21:18,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 170528 states and 247356 transitions. [2025-03-08 06:21:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:18,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:18,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:21:18,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 394101777, now seen corresponding path program 1 times [2025-03-08 06:21:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-03-08 06:21:18,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:18,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:18,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:18,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-03-08 06:21:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005345427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:18,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525171107] [2025-03-08 06:21:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:18,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:18,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:18,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:18,942 INFO L87 Difference]: Start difference. First operand 170528 states and 247356 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:20,197 INFO L93 Difference]: Finished difference Result 421819 states and 609348 transitions. [2025-03-08 06:21:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-08 06:21:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:20,565 INFO L225 Difference]: With dead ends: 421819 [2025-03-08 06:21:20,565 INFO L226 Difference]: Without dead ends: 279008 [2025-03-08 06:21:20,641 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-03-08 06:21:20,642 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 406 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279008 states. [2025-03-08 06:21:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279008 to 273566. [2025-03-08 06:21:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273566 states, 273565 states have (on average 1.4325882331438597) internal successors, (391906), 273565 states have internal predecessors, (391906), 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-03-08 06:21:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273566 states to 273566 states and 391906 transitions. [2025-03-08 06:21:24,213 INFO L78 Accepts]: Start accepts. Automaton has 273566 states and 391906 transitions. Word has length 95 [2025-03-08 06:21:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:24,213 INFO L471 AbstractCegarLoop]: Abstraction has 273566 states and 391906 transitions. [2025-03-08 06:21:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 273566 states and 391906 transitions. [2025-03-08 06:21:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:24,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:24,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:24,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:21:24,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:24,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 59389483, now seen corresponding path program 1 times [2025-03-08 06:21:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216887794] [2025-03-08 06:21:24,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:24,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:24,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:24,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:21:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216887794] [2025-03-08 06:21:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216887794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038887335] [2025-03-08 06:21:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:24,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:24,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:24,441 INFO L87 Difference]: Start difference. First operand 273566 states and 391906 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-03-08 06:21:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:26,843 INFO L93 Difference]: Finished difference Result 776666 states and 1120026 transitions. [2025-03-08 06:21:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:21:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 95 [2025-03-08 06:21:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:27,997 INFO L225 Difference]: With dead ends: 776666 [2025-03-08 06:21:27,997 INFO L226 Difference]: Without dead ends: 674840 [2025-03-08 06:21:28,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:21:28,191 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1461 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:28,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 1406 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674840 states. [2025-03-08 06:21:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674840 to 373217. [2025-03-08 06:21:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373217 states, 373216 states have (on average 1.4286900883134699) internal successors, (533210), 373216 states have internal predecessors, (533210), 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-03-08 06:21:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373217 states to 373217 states and 533210 transitions. [2025-03-08 06:21:35,870 INFO L78 Accepts]: Start accepts. Automaton has 373217 states and 533210 transitions. Word has length 95 [2025-03-08 06:21:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 373217 states and 533210 transitions. [2025-03-08 06:21:35,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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-03-08 06:21:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 373217 states and 533210 transitions. [2025-03-08 06:21:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:35,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:35,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:35,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:21:35,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:35,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash -542636731, now seen corresponding path program 1 times [2025-03-08 06:21:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186441246] [2025-03-08 06:21:35,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:35,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:35,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:35,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:35,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:35,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186441246] [2025-03-08 06:21:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186441246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:35,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651036644] [2025-03-08 06:21:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:35,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:35,935 INFO L87 Difference]: Start difference. First operand 373217 states and 533210 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:37,882 INFO L93 Difference]: Finished difference Result 586648 states and 834016 transitions. [2025-03-08 06:21:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:37,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-08 06:21:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:38,516 INFO L225 Difference]: With dead ends: 586648 [2025-03-08 06:21:38,516 INFO L226 Difference]: Without dead ends: 381140 [2025-03-08 06:21:38,613 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-03-08 06:21:38,614 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:38,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 447 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381140 states. [2025-03-08 06:21:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381140 to 373260. [2025-03-08 06:21:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373260 states, 373259 states have (on average 1.4084991922498855) internal successors, (525735), 373259 states have internal predecessors, (525735), 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-03-08 06:21:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373260 states to 373260 states and 525735 transitions. [2025-03-08 06:21:43,665 INFO L78 Accepts]: Start accepts. Automaton has 373260 states and 525735 transitions. Word has length 95 [2025-03-08 06:21:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 373260 states and 525735 transitions. [2025-03-08 06:21:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03-08 06:21:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 373260 states and 525735 transitions. [2025-03-08 06:21:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:43,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:43,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:43,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:21:43,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:21:43,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash 544692289, now seen corresponding path program 1 times [2025-03-08 06:21:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:43,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941641128] [2025-03-08 06:21:43,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:43,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:43,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:43,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:43,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:21:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941641128] [2025-03-08 06:21:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941641128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285713417] [2025-03-08 06:21:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:43,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:43,784 INFO L87 Difference]: Start difference. First operand 373260 states and 525735 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)