./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-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 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:30:18,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:30:18,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:30:18,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:30:18,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:30:18,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:30:18,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:30:18,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:30:18,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:30:18,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:30:18,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:30:18,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:30:18,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:30:18,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:30:18,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:30:18,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:18,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:30:18,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:30:18,274 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 -> 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 [2025-03-16 19:30:18,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:30:18,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:30:18,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:30:18,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:30:18,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:30:18,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:30:19,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b376fc4a/e9cadf984c3943a3bfc366033a6b9611/FLAG9fa2b4d7f [2025-03-16 19:30:19,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:30:19,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:30:19,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b376fc4a/e9cadf984c3943a3bfc366033a6b9611/FLAG9fa2b4d7f [2025-03-16 19:30:20,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b376fc4a/e9cadf984c3943a3bfc366033a6b9611 [2025-03-16 19:30:20,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:30:20,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:30:20,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:20,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:30:20,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:30:20,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7896a470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20, skipping insertion in model container [2025-03-16 19:30:20,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:30:20,422 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2025-03-16 19:30:20,442 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2025-03-16 19:30:20,458 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2025-03-16 19:30:20,473 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2025-03-16 19:30:20,482 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2025-03-16 19:30:20,489 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2025-03-16 19:30:20,496 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2025-03-16 19:30:20,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:20,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:30:20,573 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2025-03-16 19:30:20,580 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2025-03-16 19:30:20,588 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2025-03-16 19:30:20,593 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2025-03-16 19:30:20,598 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2025-03-16 19:30:20,603 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2025-03-16 19:30:20,608 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.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2025-03-16 19:30:20,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:30:20,643 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:30:20,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20 WrapperNode [2025-03-16 19:30:20,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:30:20,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:20,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:30:20,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:30:20,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,708 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1340 [2025-03-16 19:30:20,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:30:20,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:30:20,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:30:20,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:30:20,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,740 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-16 19:30:20,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:30:20,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:30:20,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:30:20,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:30:20,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (1/1) ... [2025-03-16 19:30:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:30:20,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:20,801 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-16 19:30:20,803 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-16 19:30:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:30:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:30:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:30:20,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:30:20,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:30:20,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:30:21,785 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1659: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2092: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~3#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1434: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1534: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~9#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2063: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L977: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:30:21,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2035: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1870: havoc main_~node1__m1~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1080: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~5#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: havoc main_~node3__m3~12#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1912: havoc main_~node2__m2~10#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1219: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:30:21,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc main_~check__tmp~16#1; [2025-03-16 19:30:21,831 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2025-03-16 19:30:21,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:30:21,846 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:30:21,846 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:30:21,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:21 BoogieIcfgContainer [2025-03-16 19:30:21,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:30:21,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:30:21,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:30:21,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:30:21,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:30:20" (1/3) ... [2025-03-16 19:30:21,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f003d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:21, skipping insertion in model container [2025-03-16 19:30:21,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:30:20" (2/3) ... [2025-03-16 19:30:21,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f003d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:30:21, skipping insertion in model container [2025-03-16 19:30:21,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:30:21" (3/3) ... [2025-03-16 19:30:21,854 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:30:21,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:30:21,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 265 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-16 19:30:21,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:30:21,929 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;@678f98df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:30:21,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-16 19:30:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 257 states have (on average 1.8326848249027237) internal successors, (471), 264 states have internal predecessors, (471), 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-16 19:30:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:30:21,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:21,939 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] [2025-03-16 19:30:21,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:21,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2066093333, now seen corresponding path program 1 times [2025-03-16 19:30:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122386921] [2025-03-16 19:30:21,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:30:22,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:30:22,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,310 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-16 19:30:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122386921] [2025-03-16 19:30:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122386921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578002236] [2025-03-16 19:30:22,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,335 INFO L87 Difference]: Start difference. First operand has 265 states, 257 states have (on average 1.8326848249027237) internal successors, (471), 264 states have internal predecessors, (471), 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 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,601 INFO L93 Difference]: Finished difference Result 454 states and 769 transitions. [2025-03-16 19:30:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:22,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-16 19:30:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,612 INFO L225 Difference]: With dead ends: 454 [2025-03-16 19:30:22,613 INFO L226 Difference]: Without dead ends: 301 [2025-03-16 19:30:22,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:22,619 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1323 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 337 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-16 19:30:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 275. [2025-03-16 19:30:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.3432835820895523) internal successors, (360), 274 states have internal predecessors, (360), 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-16 19:30:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 360 transitions. [2025-03-16 19:30:22,659 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 360 transitions. Word has length 46 [2025-03-16 19:30:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 360 transitions. [2025-03-16 19:30:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 360 transitions. [2025-03-16 19:30:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:30:22,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,661 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] [2025-03-16 19:30:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:30:22,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -742987571, now seen corresponding path program 1 times [2025-03-16 19:30:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124145406] [2025-03-16 19:30:22,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:30:22,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:30:22,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:22,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:22,843 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-16 19:30:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124145406] [2025-03-16 19:30:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124145406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156540982] [2025-03-16 19:30:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:22,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:22,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:22,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:22,845 INFO L87 Difference]: Start difference. First operand 275 states and 360 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:22,964 INFO L93 Difference]: Finished difference Result 390 states and 520 transitions. [2025-03-16 19:30:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-16 19:30:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:22,966 INFO L225 Difference]: With dead ends: 390 [2025-03-16 19:30:22,966 INFO L226 Difference]: Without dead ends: 222 [2025-03-16 19:30:22,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:22,967 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 567 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 130 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-16 19:30:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-16 19:30:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 215 states have (on average 1.3534883720930233) internal successors, (291), 221 states have internal predecessors, (291), 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-16 19:30:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-03-16 19:30:22,982 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 46 [2025-03-16 19:30:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:22,982 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-03-16 19:30:22,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-03-16 19:30:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-16 19:30:22,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:22,983 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] [2025-03-16 19:30:22,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:30:22,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:22,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1250418371, now seen corresponding path program 1 times [2025-03-16 19:30:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216970068] [2025-03-16 19:30:22,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-16 19:30:23,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-16 19:30:23,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,101 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-16 19:30:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216970068] [2025-03-16 19:30:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216970068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:23,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:23,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:30:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50672917] [2025-03-16 19:30:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:23,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:23,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:23,103 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:23,196 INFO L93 Difference]: Finished difference Result 346 states and 467 transitions. [2025-03-16 19:30:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-16 19:30:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:23,198 INFO L225 Difference]: With dead ends: 346 [2025-03-16 19:30:23,199 INFO L226 Difference]: Without dead ends: 214 [2025-03-16 19:30:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:23,201 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 524 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:23,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 127 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-16 19:30:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-16 19:30:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 213 states have internal predecessors, (280), 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-16 19:30:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2025-03-16 19:30:23,212 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 46 [2025-03-16 19:30:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2025-03-16 19:30:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 19:30:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2025-03-16 19:30:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:30:23,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:23,214 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] [2025-03-16 19:30:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:30:23,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:23,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1310539235, now seen corresponding path program 1 times [2025-03-16 19:30:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296558178] [2025-03-16 19:30:23,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:30:23,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:30:23,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:23,523 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-16 19:30:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296558178] [2025-03-16 19:30:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296558178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:30:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136768035] [2025-03-16 19:30:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:30:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:23,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:30:23,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:23,524 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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-16 19:30:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:23,769 INFO L93 Difference]: Finished difference Result 458 states and 615 transitions. [2025-03-16 19:30:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:30:23,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2025-03-16 19:30:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:23,770 INFO L225 Difference]: With dead ends: 458 [2025-03-16 19:30:23,770 INFO L226 Difference]: Without dead ends: 334 [2025-03-16 19:30:23,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:30:23,776 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 712 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:23,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 381 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-16 19:30:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2025-03-16 19:30:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 213 states have internal predecessors, (279), 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-16 19:30:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2025-03-16 19:30:23,785 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 47 [2025-03-16 19:30:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2025-03-16 19:30:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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-16 19:30:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2025-03-16 19:30:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:30:23,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:23,789 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] [2025-03-16 19:30:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:30:23,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1520218528, now seen corresponding path program 1 times [2025-03-16 19:30:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74040045] [2025-03-16 19:30:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:23,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:30:23,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:30:23,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:23,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:24,024 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-16 19:30:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74040045] [2025-03-16 19:30:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74040045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699282654] [2025-03-16 19:30:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:24,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:24,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:24,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:24,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:24,025 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-16 19:30:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:24,309 INFO L93 Difference]: Finished difference Result 362 states and 494 transitions. [2025-03-16 19:30:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2025-03-16 19:30:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:24,311 INFO L225 Difference]: With dead ends: 362 [2025-03-16 19:30:24,311 INFO L226 Difference]: Without dead ends: 261 [2025-03-16 19:30:24,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:30:24,312 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 662 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:24,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 483 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-16 19:30:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 214. [2025-03-16 19:30:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 213 states have internal predecessors, (278), 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-16 19:30:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 278 transitions. [2025-03-16 19:30:24,322 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 278 transitions. Word has length 47 [2025-03-16 19:30:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:24,323 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 278 transitions. [2025-03-16 19:30:24,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-16 19:30:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 278 transitions. [2025-03-16 19:30:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:30:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:24,323 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] [2025-03-16 19:30:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:30:24,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1962820767, now seen corresponding path program 1 times [2025-03-16 19:30:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511197198] [2025-03-16 19:30:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:24,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:30:24,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:30:24,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:24,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:24,515 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-16 19:30:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511197198] [2025-03-16 19:30:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511197198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120869289] [2025-03-16 19:30:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:24,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:24,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:24,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:24,516 INFO L87 Difference]: Start difference. First operand 214 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-16 19:30:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:24,840 INFO L93 Difference]: Finished difference Result 357 states and 471 transitions. [2025-03-16 19:30:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:30:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 47 [2025-03-16 19:30:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:24,843 INFO L225 Difference]: With dead ends: 357 [2025-03-16 19:30:24,843 INFO L226 Difference]: Without dead ends: 352 [2025-03-16 19:30:24,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:30:24,844 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 574 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:24,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 844 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-16 19:30:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 214. [2025-03-16 19:30:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 213 states have internal predecessors, (277), 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-16 19:30:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2025-03-16 19:30:24,853 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 47 [2025-03-16 19:30:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:24,853 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2025-03-16 19:30:24,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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-16 19:30:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2025-03-16 19:30:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:30:24,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:24,853 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] [2025-03-16 19:30:24,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:30:24,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:24,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash -713144692, now seen corresponding path program 1 times [2025-03-16 19:30:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363249473] [2025-03-16 19:30:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:30:24,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:30:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:25,323 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-16 19:30:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363249473] [2025-03-16 19:30:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363249473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:30:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244961921] [2025-03-16 19:30:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:30:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:30:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:30:25,325 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-16 19:30:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:25,760 INFO L93 Difference]: Finished difference Result 348 states and 462 transitions. [2025-03-16 19:30:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 49 [2025-03-16 19:30:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:25,762 INFO L225 Difference]: With dead ends: 348 [2025-03-16 19:30:25,762 INFO L226 Difference]: Without dead ends: 344 [2025-03-16 19:30:25,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:25,762 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 772 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:25,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1045 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-16 19:30:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 210. [2025-03-16 19:30:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 204 states have (on average 1.338235294117647) internal successors, (273), 209 states have internal predecessors, (273), 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-16 19:30:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2025-03-16 19:30:25,772 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 49 [2025-03-16 19:30:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:25,773 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2025-03-16 19:30:25,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-16 19:30:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2025-03-16 19:30:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:30:25,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:25,774 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] [2025-03-16 19:30:25,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:30:25,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1183920672, now seen corresponding path program 1 times [2025-03-16 19:30:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580669933] [2025-03-16 19:30:25,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:25,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:30:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:30:25,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:26,467 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-16 19:30:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580669933] [2025-03-16 19:30:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580669933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:30:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995524390] [2025-03-16 19:30:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:26,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:30:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:26,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:30:26,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:30:26,468 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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-16 19:30:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:27,460 INFO L93 Difference]: Finished difference Result 455 states and 625 transitions. [2025-03-16 19:30:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:30:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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 49 [2025-03-16 19:30:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:27,463 INFO L225 Difference]: With dead ends: 455 [2025-03-16 19:30:27,463 INFO L226 Difference]: Without dead ends: 367 [2025-03-16 19:30:27,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:30:27,465 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1261 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:27,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1907 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:30:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-16 19:30:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 216. [2025-03-16 19:30:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 210 states have (on average 1.338095238095238) internal successors, (281), 215 states have internal predecessors, (281), 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-16 19:30:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 281 transitions. [2025-03-16 19:30:27,473 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 281 transitions. Word has length 49 [2025-03-16 19:30:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:27,474 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 281 transitions. [2025-03-16 19:30:27,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 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-16 19:30:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 281 transitions. [2025-03-16 19:30:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:30:27,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:27,475 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] [2025-03-16 19:30:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:30:27,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -392093984, now seen corresponding path program 1 times [2025-03-16 19:30:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907560878] [2025-03-16 19:30:27,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:27,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:30:27,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:30:27,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:27,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:27,846 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-16 19:30:27,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:27,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907560878] [2025-03-16 19:30:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907560878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:30:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704141365] [2025-03-16 19:30:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:30:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:27,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:30:27,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:30:27,848 INFO L87 Difference]: Start difference. First operand 216 states and 281 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-16 19:30:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:28,216 INFO L93 Difference]: Finished difference Result 343 states and 473 transitions. [2025-03-16 19:30:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 49 [2025-03-16 19:30:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:28,217 INFO L225 Difference]: With dead ends: 343 [2025-03-16 19:30:28,217 INFO L226 Difference]: Without dead ends: 248 [2025-03-16 19:30:28,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:28,218 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 667 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:28,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1101 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-16 19:30:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 205. [2025-03-16 19:30:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.34) internal successors, (268), 204 states have internal predecessors, (268), 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-16 19:30:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2025-03-16 19:30:28,221 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 49 [2025-03-16 19:30:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:28,222 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2025-03-16 19:30:28,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-16 19:30:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2025-03-16 19:30:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:30:28,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:28,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:28,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:30:28,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:28,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 400552008, now seen corresponding path program 1 times [2025-03-16 19:30:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141805997] [2025-03-16 19:30:28,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:28,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:30:28,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:30:28,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:28,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:28,339 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-16 19:30:28,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141805997] [2025-03-16 19:30:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141805997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130262177] [2025-03-16 19:30:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:28,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:28,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:28,341 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:28,556 INFO L93 Difference]: Finished difference Result 366 states and 499 transitions. [2025-03-16 19:30:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-03-16 19:30:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:28,558 INFO L225 Difference]: With dead ends: 366 [2025-03-16 19:30:28,558 INFO L226 Difference]: Without dead ends: 252 [2025-03-16 19:30:28,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:30:28,559 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 375 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:28,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 433 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-16 19:30:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 205. [2025-03-16 19:30:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.33) internal successors, (266), 204 states have internal predecessors, (266), 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-16 19:30:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 266 transitions. [2025-03-16 19:30:28,563 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 266 transitions. Word has length 50 [2025-03-16 19:30:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:28,563 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 266 transitions. [2025-03-16 19:30:28,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 266 transitions. [2025-03-16 19:30:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:30:28,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:28,564 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] [2025-03-16 19:30:28,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:30:28,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1020722070, now seen corresponding path program 1 times [2025-03-16 19:30:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636260668] [2025-03-16 19:30:28,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:28,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:30:28,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:30:28,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:28,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:28,736 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-16 19:30:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:28,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636260668] [2025-03-16 19:30:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636260668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962820583] [2025-03-16 19:30:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:28,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:28,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:28,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:28,738 INFO L87 Difference]: Start difference. First operand 205 states and 266 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:28,997 INFO L93 Difference]: Finished difference Result 340 states and 448 transitions. [2025-03-16 19:30:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:30:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-03-16 19:30:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:28,998 INFO L225 Difference]: With dead ends: 340 [2025-03-16 19:30:28,999 INFO L226 Difference]: Without dead ends: 333 [2025-03-16 19:30:28,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:30:29,000 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 514 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 660 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-16 19:30:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2025-03-16 19:30:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.325) internal successors, (265), 204 states have internal predecessors, (265), 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-16 19:30:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2025-03-16 19:30:29,005 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 50 [2025-03-16 19:30:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,006 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2025-03-16 19:30:29,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2025-03-16 19:30:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:30:29,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,006 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] [2025-03-16 19:30:29,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:30:29,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:29,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1953730579, now seen corresponding path program 1 times [2025-03-16 19:30:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540312524] [2025-03-16 19:30:29,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:30:29,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:30:29,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,140 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-16 19:30:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540312524] [2025-03-16 19:30:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540312524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667042747] [2025-03-16 19:30:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:29,141 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:29,366 INFO L93 Difference]: Finished difference Result 340 states and 447 transitions. [2025-03-16 19:30:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:29,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-03-16 19:30:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:29,367 INFO L225 Difference]: With dead ends: 340 [2025-03-16 19:30:29,367 INFO L226 Difference]: Without dead ends: 333 [2025-03-16 19:30:29,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:30:29,368 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 351 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:29,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 583 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-16 19:30:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2025-03-16 19:30:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.315) internal successors, (263), 204 states have internal predecessors, (263), 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-16 19:30:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 263 transitions. [2025-03-16 19:30:29,374 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 263 transitions. Word has length 50 [2025-03-16 19:30:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 263 transitions. [2025-03-16 19:30:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-16 19:30:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 263 transitions. [2025-03-16 19:30:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:30:29,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:29,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:29,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:30:29,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:29,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1113350436, now seen corresponding path program 1 times [2025-03-16 19:30:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851378771] [2025-03-16 19:30:29,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:29,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:30:29,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:30:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:29,678 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-16 19:30:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851378771] [2025-03-16 19:30:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851378771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:30:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885596491] [2025-03-16 19:30:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:29,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:30:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:29,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:30:29,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:30:29,681 INFO L87 Difference]: Start difference. First operand 205 states and 263 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 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-16 19:30:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:30,118 INFO L93 Difference]: Finished difference Result 413 states and 563 transitions. [2025-03-16 19:30:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:30:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 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 50 [2025-03-16 19:30:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:30,120 INFO L225 Difference]: With dead ends: 413 [2025-03-16 19:30:30,120 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 19:30:30,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:30:30,121 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 757 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:30,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1112 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 19:30:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 195. [2025-03-16 19:30:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 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-16 19:30:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2025-03-16 19:30:30,125 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 50 [2025-03-16 19:30:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:30,126 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2025-03-16 19:30:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 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-16 19:30:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2025-03-16 19:30:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:30:30,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:30,127 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] [2025-03-16 19:30:30,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:30:30,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash 465534439, now seen corresponding path program 1 times [2025-03-16 19:30:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298060168] [2025-03-16 19:30:30,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:30,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:30:30,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:30:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:30,596 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-16 19:30:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298060168] [2025-03-16 19:30:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298060168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:30,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:30:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629255542] [2025-03-16 19:30:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:30,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:30:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:30,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:30:30,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:30:30,599 INFO L87 Difference]: Start difference. First operand 195 states and 251 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:31,216 INFO L93 Difference]: Finished difference Result 230 states and 287 transitions. [2025-03-16 19:30:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:30:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 52 [2025-03-16 19:30:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:31,218 INFO L225 Difference]: With dead ends: 230 [2025-03-16 19:30:31,218 INFO L226 Difference]: Without dead ends: 224 [2025-03-16 19:30:31,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:30:31,219 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 305 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:31,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1608 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:30:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-16 19:30:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 201. [2025-03-16 19:30:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 200 states have internal predecessors, (259), 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-16 19:30:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 259 transitions. [2025-03-16 19:30:31,222 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 259 transitions. Word has length 52 [2025-03-16 19:30:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:31,222 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 259 transitions. [2025-03-16 19:30:31,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 259 transitions. [2025-03-16 19:30:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:30:31,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:31,223 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] [2025-03-16 19:30:31,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:30:31,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:31,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 500946522, now seen corresponding path program 1 times [2025-03-16 19:30:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:31,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121320711] [2025-03-16 19:30:31,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:31,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:30:31,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:30:31,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:31,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:31,740 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-16 19:30:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121320711] [2025-03-16 19:30:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121320711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:30:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61826991] [2025-03-16 19:30:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:30:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:31,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:30:31,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:30:31,741 INFO L87 Difference]: Start difference. First operand 201 states and 259 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:32,519 INFO L93 Difference]: Finished difference Result 345 states and 448 transitions. [2025-03-16 19:30:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:30:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 52 [2025-03-16 19:30:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:32,521 INFO L225 Difference]: With dead ends: 345 [2025-03-16 19:30:32,521 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 19:30:32,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 19:30:32,523 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 416 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:32,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 2738 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:30:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 19:30:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 204. [2025-03-16 19:30:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.31) internal successors, (262), 203 states have internal predecessors, (262), 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-16 19:30:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 262 transitions. [2025-03-16 19:30:32,526 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 262 transitions. Word has length 52 [2025-03-16 19:30:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:32,527 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 262 transitions. [2025-03-16 19:30:32,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 262 transitions. [2025-03-16 19:30:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:30:32,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:32,528 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] [2025-03-16 19:30:32,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:30:32,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1498268861, now seen corresponding path program 1 times [2025-03-16 19:30:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854631496] [2025-03-16 19:30:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:32,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:30:32,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:30:32,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:32,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:32,978 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-16 19:30:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854631496] [2025-03-16 19:30:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854631496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:30:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513979671] [2025-03-16 19:30:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:30:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:32,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:30:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:30:32,980 INFO L87 Difference]: Start difference. First operand 204 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:33,495 INFO L93 Difference]: Finished difference Result 234 states and 290 transitions. [2025-03-16 19:30:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:30:33,495 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 52 [2025-03-16 19:30:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:33,496 INFO L225 Difference]: With dead ends: 234 [2025-03-16 19:30:33,496 INFO L226 Difference]: Without dead ends: 226 [2025-03-16 19:30:33,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:30:33,497 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 397 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:33,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1470 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:30:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-16 19:30:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2025-03-16 19:30:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 205 states have (on average 1.302439024390244) internal successors, (267), 208 states have internal predecessors, (267), 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-16 19:30:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2025-03-16 19:30:33,500 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 267 transitions. Word has length 52 [2025-03-16 19:30:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:33,500 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 267 transitions. [2025-03-16 19:30:33,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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-16 19:30:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 267 transitions. [2025-03-16 19:30:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:30:33,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:33,500 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] [2025-03-16 19:30:33,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:30:33,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:33,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash -31327094, now seen corresponding path program 1 times [2025-03-16 19:30:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:33,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252345240] [2025-03-16 19:30:33,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:33,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:30:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:30:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:33,912 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-16 19:30:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252345240] [2025-03-16 19:30:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252345240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:30:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994808059] [2025-03-16 19:30:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:30:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:33,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:30:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:30:33,914 INFO L87 Difference]: Start difference. First operand 209 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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-16 19:30:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:34,569 INFO L93 Difference]: Finished difference Result 337 states and 439 transitions. [2025-03-16 19:30:34,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:30:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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 53 [2025-03-16 19:30:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:34,570 INFO L225 Difference]: With dead ends: 337 [2025-03-16 19:30:34,570 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 19:30:34,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:30:34,571 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 465 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:34,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2273 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 19:30:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 206. [2025-03-16 19:30:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 202 states have (on average 1.301980198019802) internal successors, (263), 205 states have internal predecessors, (263), 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-16 19:30:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2025-03-16 19:30:34,575 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 53 [2025-03-16 19:30:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2025-03-16 19:30:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 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-16 19:30:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2025-03-16 19:30:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:30:34,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:34,577 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] [2025-03-16 19:30:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:30:34,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1880753334, now seen corresponding path program 1 times [2025-03-16 19:30:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014375062] [2025-03-16 19:30:34,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:34,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:30:34,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:30:34,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:34,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:34,839 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-16 19:30:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014375062] [2025-03-16 19:30:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014375062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:30:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005744011] [2025-03-16 19:30:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:30:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:34,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:30:34,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:30:34,840 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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-16 19:30:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:35,145 INFO L93 Difference]: Finished difference Result 319 states and 422 transitions. [2025-03-16 19:30:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:30:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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 53 [2025-03-16 19:30:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:35,146 INFO L225 Difference]: With dead ends: 319 [2025-03-16 19:30:35,146 INFO L226 Difference]: Without dead ends: 313 [2025-03-16 19:30:35,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:30:35,147 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 449 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:35,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 978 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:30:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-16 19:30:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2025-03-16 19:30:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 191 states have (on average 1.2984293193717278) internal successors, (248), 193 states have internal predecessors, (248), 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-16 19:30:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 248 transitions. [2025-03-16 19:30:35,151 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 248 transitions. Word has length 53 [2025-03-16 19:30:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:35,151 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 248 transitions. [2025-03-16 19:30:35,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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-16 19:30:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 248 transitions. [2025-03-16 19:30:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:30:35,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:35,152 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] [2025-03-16 19:30:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:30:35,152 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1877461571, now seen corresponding path program 1 times [2025-03-16 19:30:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732800849] [2025-03-16 19:30:35,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:30:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:30:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:35,385 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-16 19:30:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732800849] [2025-03-16 19:30:35,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732800849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:35,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:35,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:30:35,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445922336] [2025-03-16 19:30:35,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:35,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:30:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:35,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:30:35,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:30:35,387 INFO L87 Difference]: Start difference. First operand 194 states and 248 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-16 19:30:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:35,595 INFO L93 Difference]: Finished difference Result 300 states and 397 transitions. [2025-03-16 19:30:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:30:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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 53 [2025-03-16 19:30:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:35,597 INFO L225 Difference]: With dead ends: 300 [2025-03-16 19:30:35,597 INFO L226 Difference]: Without dead ends: 277 [2025-03-16 19:30:35,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:30:35,597 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 807 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:35,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 413 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-16 19:30:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2025-03-16 19:30:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.319526627218935) internal successors, (223), 170 states have internal predecessors, (223), 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-16 19:30:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2025-03-16 19:30:35,601 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 53 [2025-03-16 19:30:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:35,601 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2025-03-16 19:30:35,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-16 19:30:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2025-03-16 19:30:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:30:35,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:35,601 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] [2025-03-16 19:30:35,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:30:35,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1724039555, now seen corresponding path program 1 times [2025-03-16 19:30:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:35,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076143227] [2025-03-16 19:30:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:35,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:30:35,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:30:35,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:35,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:35,850 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-16 19:30:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076143227] [2025-03-16 19:30:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076143227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:30:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105056938] [2025-03-16 19:30:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:35,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:30:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:35,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:30:35,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:30:35,851 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-16 19:30:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,041 INFO L93 Difference]: Finished difference Result 171 states and 223 transitions. [2025-03-16 19:30:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:30:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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 53 [2025-03-16 19:30:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,042 INFO L225 Difference]: With dead ends: 171 [2025-03-16 19:30:36,042 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 19:30:36,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:30:36,043 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 208 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 606 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 19:30:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-16 19:30:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 158 states have internal predecessors, (210), 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-16 19:30:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2025-03-16 19:30:36,046 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 53 [2025-03-16 19:30:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,046 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2025-03-16 19:30:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-16 19:30:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2025-03-16 19:30:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:30:36,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:30:36,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1917550819, now seen corresponding path program 1 times [2025-03-16 19:30:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298742677] [2025-03-16 19:30:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:30:36,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:30:36,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,105 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-16 19:30:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298742677] [2025-03-16 19:30:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298742677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807578913] [2025-03-16 19:30:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:36,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:36,106 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-16 19:30:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,157 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2025-03-16 19:30:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:30:36,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 70 [2025-03-16 19:30:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,159 INFO L225 Difference]: With dead ends: 663 [2025-03-16 19:30:36,159 INFO L226 Difference]: Without dead ends: 579 [2025-03-16 19:30:36,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:36,159 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 487 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 510 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-16 19:30:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 241. [2025-03-16 19:30:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.3875) internal successors, (333), 240 states have internal predecessors, (333), 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-16 19:30:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2025-03-16 19:30:36,164 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 70 [2025-03-16 19:30:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2025-03-16 19:30:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-16 19:30:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2025-03-16 19:30:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:30:36,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:30:36,165 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2102746887, now seen corresponding path program 1 times [2025-03-16 19:30:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308624590] [2025-03-16 19:30:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:30:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:30:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,219 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-16 19:30:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308624590] [2025-03-16 19:30:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308624590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34100152] [2025-03-16 19:30:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:36,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:36,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:36,220 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,259 INFO L93 Difference]: Finished difference Result 823 states and 1210 transitions. [2025-03-16 19:30:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-03-16 19:30:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,261 INFO L225 Difference]: With dead ends: 823 [2025-03-16 19:30:36,261 INFO L226 Difference]: Without dead ends: 657 [2025-03-16 19:30:36,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:36,264 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 287 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 434 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-16 19:30:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 405. [2025-03-16 19:30:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.438118811881188) internal successors, (581), 404 states have internal predecessors, (581), 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-16 19:30:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2025-03-16 19:30:36,270 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 72 [2025-03-16 19:30:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,270 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2025-03-16 19:30:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2025-03-16 19:30:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:30:36,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:30:36,271 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1558142855, now seen corresponding path program 1 times [2025-03-16 19:30:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522003085] [2025-03-16 19:30:36,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:30:36,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:30:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,326 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-16 19:30:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522003085] [2025-03-16 19:30:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522003085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764595959] [2025-03-16 19:30:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:36,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:36,327 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,375 INFO L93 Difference]: Finished difference Result 987 states and 1458 transitions. [2025-03-16 19:30:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-03-16 19:30:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,377 INFO L225 Difference]: With dead ends: 987 [2025-03-16 19:30:36,377 INFO L226 Difference]: Without dead ends: 821 [2025-03-16 19:30:36,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:36,378 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 294 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 441 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-16 19:30:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 651. [2025-03-16 19:30:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.4646153846153847) internal successors, (952), 650 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-16 19:30:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 952 transitions. [2025-03-16 19:30:36,388 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 952 transitions. Word has length 72 [2025-03-16 19:30:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 952 transitions. [2025-03-16 19:30:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 952 transitions. [2025-03-16 19:30:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:30:36,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:30:36,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1595579419, now seen corresponding path program 1 times [2025-03-16 19:30:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237942033] [2025-03-16 19:30:36,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:30:36,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:30:36,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,420 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-16 19:30:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237942033] [2025-03-16 19:30:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237942033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606528713] [2025-03-16 19:30:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:36,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:36,421 INFO L87 Difference]: Start difference. First operand 651 states and 952 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-16 19:30:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,443 INFO L93 Difference]: Finished difference Result 1713 states and 2534 transitions. [2025-03-16 19:30:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-03-16 19:30:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,446 INFO L225 Difference]: With dead ends: 1713 [2025-03-16 19:30:36,446 INFO L226 Difference]: Without dead ends: 1137 [2025-03-16 19:30:36,447 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-16 19:30:36,447 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 68 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 196 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-16 19:30:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1121. [2025-03-16 19:30:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4401785714285715) internal successors, (1613), 1120 states have internal predecessors, (1613), 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-16 19:30:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1613 transitions. [2025-03-16 19:30:36,462 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1613 transitions. Word has length 72 [2025-03-16 19:30:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,462 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1613 transitions. [2025-03-16 19:30:36,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-16 19:30:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1613 transitions. [2025-03-16 19:30:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:30:36,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:30:36,463 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1630673217, now seen corresponding path program 1 times [2025-03-16 19:30:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584902943] [2025-03-16 19:30:36,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:30:36,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:30:36,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,545 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-16 19:30:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584902943] [2025-03-16 19:30:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584902943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386926424] [2025-03-16 19:30:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:36,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:36,546 INFO L87 Difference]: Start difference. First operand 1121 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,586 INFO L93 Difference]: Finished difference Result 2169 states and 3145 transitions. [2025-03-16 19:30:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-03-16 19:30:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,589 INFO L225 Difference]: With dead ends: 2169 [2025-03-16 19:30:36,589 INFO L226 Difference]: Without dead ends: 1123 [2025-03-16 19:30:36,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:36,591 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 108 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 239 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-03-16 19:30:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1121. [2025-03-16 19:30:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4330357142857142) internal successors, (1605), 1120 states have internal predecessors, (1605), 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-16 19:30:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1605 transitions. [2025-03-16 19:30:36,610 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1605 transitions. Word has length 72 [2025-03-16 19:30:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,610 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1605 transitions. [2025-03-16 19:30:36,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-16 19:30:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1605 transitions. [2025-03-16 19:30:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:30:36,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:30:36,612 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -953075977, now seen corresponding path program 1 times [2025-03-16 19:30:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570063033] [2025-03-16 19:30:36,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:30:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:30:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,660 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-16 19:30:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570063033] [2025-03-16 19:30:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570063033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453070558] [2025-03-16 19:30:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:36,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:36,662 INFO L87 Difference]: Start difference. First operand 1121 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-16 19:30:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,679 INFO L93 Difference]: Finished difference Result 3101 states and 4455 transitions. [2025-03-16 19:30:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2025-03-16 19:30:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,684 INFO L225 Difference]: With dead ends: 3101 [2025-03-16 19:30:36,684 INFO L226 Difference]: Without dead ends: 2055 [2025-03-16 19:30:36,685 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-16 19:30:36,686 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-03-16 19:30:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1941. [2025-03-16 19:30:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1940 states have (on average 1.4242268041237114) internal successors, (2763), 1940 states have internal predecessors, (2763), 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-16 19:30:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2763 transitions. [2025-03-16 19:30:36,716 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2763 transitions. Word has length 73 [2025-03-16 19:30:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,716 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2763 transitions. [2025-03-16 19:30:36,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-16 19:30:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2763 transitions. [2025-03-16 19:30:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:30:36,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:30:36,717 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash 892435329, now seen corresponding path program 1 times [2025-03-16 19:30:36,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415805264] [2025-03-16 19:30:36,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:30:36,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:30:36,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,767 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-16 19:30:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415805264] [2025-03-16 19:30:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415805264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157609980] [2025-03-16 19:30:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:36,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:36,768 INFO L87 Difference]: Start difference. First operand 1941 states and 2763 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-16 19:30:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:36,793 INFO L93 Difference]: Finished difference Result 5449 states and 7733 transitions. [2025-03-16 19:30:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-16 19:30:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:36,803 INFO L225 Difference]: With dead ends: 5449 [2025-03-16 19:30:36,803 INFO L226 Difference]: Without dead ends: 3583 [2025-03-16 19:30:36,805 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-16 19:30:36,806 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:36,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2025-03-16 19:30:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3357. [2025-03-16 19:30:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.4049463647199048) internal successors, (4715), 3356 states have internal predecessors, (4715), 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-16 19:30:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4715 transitions. [2025-03-16 19:30:36,870 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4715 transitions. Word has length 74 [2025-03-16 19:30:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:36,870 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4715 transitions. [2025-03-16 19:30:36,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-16 19:30:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4715 transitions. [2025-03-16 19:30:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:30:36,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:36,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:36,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:30:36,871 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:36,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:36,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1514443733, now seen corresponding path program 1 times [2025-03-16 19:30:36,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:36,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991302930] [2025-03-16 19:30:36,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:30:36,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:30:36,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:36,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:36,992 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-16 19:30:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991302930] [2025-03-16 19:30:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991302930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:30:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248524105] [2025-03-16 19:30:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:30:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:30:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:36,993 INFO L87 Difference]: Start difference. First operand 3357 states and 4715 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-16 19:30:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:37,018 INFO L93 Difference]: Finished difference Result 3503 states and 4908 transitions. [2025-03-16 19:30:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:30:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2025-03-16 19:30:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:37,027 INFO L225 Difference]: With dead ends: 3503 [2025-03-16 19:30:37,027 INFO L226 Difference]: Without dead ends: 3501 [2025-03-16 19:30:37,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:30:37,029 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:37,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2025-03-16 19:30:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2025-03-16 19:30:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3500 states have (on average 1.3791428571428572) internal successors, (4827), 3500 states have internal predecessors, (4827), 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-16 19:30:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 4827 transitions. [2025-03-16 19:30:37,077 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 4827 transitions. Word has length 75 [2025-03-16 19:30:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:37,077 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 4827 transitions. [2025-03-16 19:30:37,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-16 19:30:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 4827 transitions. [2025-03-16 19:30:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:30:37,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:37,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:37,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:30:37,078 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:37,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1185024937, now seen corresponding path program 1 times [2025-03-16 19:30:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553931905] [2025-03-16 19:30:37,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:37,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:30:37,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:30:37,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:37,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:37,146 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-16 19:30:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553931905] [2025-03-16 19:30:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553931905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:30:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031409954] [2025-03-16 19:30:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:30:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:37,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:30:37,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:30:37,148 INFO L87 Difference]: Start difference. First operand 3501 states and 4827 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-16 19:30:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:37,207 INFO L93 Difference]: Finished difference Result 6461 states and 8959 transitions. [2025-03-16 19:30:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:30:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2025-03-16 19:30:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:37,220 INFO L225 Difference]: With dead ends: 6461 [2025-03-16 19:30:37,221 INFO L226 Difference]: Without dead ends: 5475 [2025-03-16 19:30:37,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:30:37,223 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 287 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:37,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 464 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2025-03-16 19:30:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 4485. [2025-03-16 19:30:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.3797948260481714) internal successors, (6187), 4484 states have internal predecessors, (6187), 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-16 19:30:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6187 transitions. [2025-03-16 19:30:37,289 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6187 transitions. Word has length 75 [2025-03-16 19:30:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:37,289 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6187 transitions. [2025-03-16 19:30:37,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-16 19:30:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6187 transitions. [2025-03-16 19:30:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:30:37,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:37,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:37,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:30:37,290 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:37,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash -376631045, now seen corresponding path program 1 times [2025-03-16 19:30:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:37,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975170793] [2025-03-16 19:30:37,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:37,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:37,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:30:37,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:30:37,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:37,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:37,339 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-16 19:30:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975170793] [2025-03-16 19:30:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975170793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292811263] [2025-03-16 19:30:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:37,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:37,340 INFO L87 Difference]: Start difference. First operand 4485 states and 6187 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:37,378 INFO L93 Difference]: Finished difference Result 11721 states and 16157 transitions. [2025-03-16 19:30:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:30:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:37,396 INFO L225 Difference]: With dead ends: 11721 [2025-03-16 19:30:37,396 INFO L226 Difference]: Without dead ends: 7311 [2025-03-16 19:30:37,403 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-16 19:30:37,404 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:37,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 260 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2025-03-16 19:30:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 6733. [2025-03-16 19:30:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 6732 states have (on average 1.3539809863339276) internal successors, (9115), 6732 states have internal predecessors, (9115), 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-16 19:30:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 9115 transitions. [2025-03-16 19:30:37,493 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 9115 transitions. Word has length 76 [2025-03-16 19:30:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 6733 states and 9115 transitions. [2025-03-16 19:30:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 9115 transitions. [2025-03-16 19:30:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:30:37,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:37,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:37,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:30:37,496 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:37,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1921236819, now seen corresponding path program 1 times [2025-03-16 19:30:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:37,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583722307] [2025-03-16 19:30:37,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:37,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:30:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:30:37,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:37,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:37,572 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-16 19:30:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583722307] [2025-03-16 19:30:37,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583722307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:37,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:37,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:30:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247187960] [2025-03-16 19:30:37,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:37,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:30:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:37,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:30:37,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:30:37,573 INFO L87 Difference]: Start difference. First operand 6733 states and 9115 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:37,604 INFO L93 Difference]: Finished difference Result 13393 states and 18149 transitions. [2025-03-16 19:30:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:30:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:30:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:37,622 INFO L225 Difference]: With dead ends: 13393 [2025-03-16 19:30:37,622 INFO L226 Difference]: Without dead ends: 6735 [2025-03-16 19:30:37,629 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-16 19:30:37,629 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:37,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 238 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:30:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2025-03-16 19:30:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 6733. [2025-03-16 19:30:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 6732 states have (on average 1.3325906120023767) internal successors, (8971), 6732 states have internal predecessors, (8971), 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-16 19:30:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8971 transitions. [2025-03-16 19:30:37,705 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8971 transitions. Word has length 97 [2025-03-16 19:30:37,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:37,705 INFO L471 AbstractCegarLoop]: Abstraction has 6733 states and 8971 transitions. [2025-03-16 19:30:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:30:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8971 transitions. [2025-03-16 19:30:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:30:37,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:37,707 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, 1, 1] [2025-03-16 19:30:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:30:37,707 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:37,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash -459617719, now seen corresponding path program 1 times [2025-03-16 19:30:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926020527] [2025-03-16 19:30:37,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:30:37,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:30:37,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:37,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:30:37,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:37,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926020527] [2025-03-16 19:30:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926020527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:30:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:30:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:30:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375463707] [2025-03-16 19:30:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:30:37,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:30:37,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:37,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:30:37,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:30:37,847 INFO L87 Difference]: Start difference. First operand 6733 states and 8971 transitions. Second operand has 8 states, 8 states have (on average 11.25) 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) [2025-03-16 19:30:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:38,099 INFO L93 Difference]: Finished difference Result 20303 states and 27007 transitions. [2025-03-16 19:30:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:30:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) 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) Word has length 97 [2025-03-16 19:30:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:38,120 INFO L225 Difference]: With dead ends: 20303 [2025-03-16 19:30:38,120 INFO L226 Difference]: Without dead ends: 13633 [2025-03-16 19:30:38,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:30:38,130 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 370 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:38,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 473 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:30:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2025-03-16 19:30:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 6733. [2025-03-16 19:30:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 6732 states have (on average 1.332293523469994) internal successors, (8969), 6732 states have internal predecessors, (8969), 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-16 19:30:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8969 transitions. [2025-03-16 19:30:38,242 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8969 transitions. Word has length 97 [2025-03-16 19:30:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 6733 states and 8969 transitions. [2025-03-16 19:30:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) 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) [2025-03-16 19:30:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8969 transitions. [2025-03-16 19:30:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:30:38,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:38,244 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, 1, 1, 1, 1] [2025-03-16 19:30:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:30:38,244 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1651060159, now seen corresponding path program 1 times [2025-03-16 19:30:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708388954] [2025-03-16 19:30:38,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:38,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:38,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:38,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708388954] [2025-03-16 19:30:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708388954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584519107] [2025-03-16 19:30:38,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:38,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:38,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:38,595 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-16 19:30:38,597 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-16 19:30:38,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:30:38,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:30:38,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:38,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:38,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:30:38,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:30:38,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:30:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584519107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 21 [2025-03-16 19:30:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31813862] [2025-03-16 19:30:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:30:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:39,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:30:39,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:30:39,333 INFO L87 Difference]: Start difference. First operand 6733 states and 8969 transitions. Second operand has 21 states, 21 states have (on average 13.428571428571429) internal successors, (282), 21 states have internal predecessors, (282), 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-16 19:30:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:45,648 INFO L93 Difference]: Finished difference Result 82559 states and 109727 transitions. [2025-03-16 19:30:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-03-16 19:30:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.428571428571429) internal successors, (282), 21 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:30:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:45,760 INFO L225 Difference]: With dead ends: 82559 [2025-03-16 19:30:45,760 INFO L226 Difference]: Without dead ends: 75901 [2025-03-16 19:30:45,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12652 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4044, Invalid=26406, Unknown=0, NotChecked=0, Total=30450 [2025-03-16 19:30:45,823 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 6728 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6728 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 3013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:45,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6728 Valid, 1887 Invalid, 3013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:30:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75901 states. [2025-03-16 19:30:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75901 to 58327. [2025-03-16 19:30:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58327 states, 58326 states have (on average 1.3267325035147275) internal successors, (77383), 58326 states have internal predecessors, (77383), 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-16 19:30:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58327 states to 58327 states and 77383 transitions. [2025-03-16 19:30:46,547 INFO L78 Accepts]: Start accepts. Automaton has 58327 states and 77383 transitions. Word has length 99 [2025-03-16 19:30:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 58327 states and 77383 transitions. [2025-03-16 19:30:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.428571428571429) internal successors, (282), 21 states have internal predecessors, (282), 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-16 19:30:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 58327 states and 77383 transitions. [2025-03-16 19:30:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:30:46,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:46,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:46,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:30:46,754 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,SelfDestructingSolverStorable32 [2025-03-16 19:30:46,754 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:46,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2030076553, now seen corresponding path program 1 times [2025-03-16 19:30:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900198094] [2025-03-16 19:30:46,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:46,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:46,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:46,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900198094] [2025-03-16 19:30:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900198094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304222286] [2025-03-16 19:30:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:47,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:47,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:30:47,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:47,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:47,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:47,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:30:47,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:48,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304222286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:48,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-03-16 19:30:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621354650] [2025-03-16 19:30:48,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:30:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:48,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:30:48,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:30:48,978 INFO L87 Difference]: Start difference. First operand 58327 states and 77383 transitions. Second operand has 27 states, 27 states have (on average 9.037037037037036) internal successors, (244), 26 states have internal predecessors, (244), 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-16 19:30:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:50,640 INFO L93 Difference]: Finished difference Result 301055 states and 399671 transitions. [2025-03-16 19:30:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 19:30:50,640 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.037037037037036) internal successors, (244), 26 states have internal predecessors, (244), 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 100 [2025-03-16 19:30:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:51,159 INFO L225 Difference]: With dead ends: 301055 [2025-03-16 19:30:51,159 INFO L226 Difference]: Without dead ends: 242829 [2025-03-16 19:30:51,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=834, Invalid=3588, Unknown=0, NotChecked=0, Total=4422 [2025-03-16 19:30:51,220 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1729 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:51,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1417 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:30:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242829 states. [2025-03-16 19:30:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242829 to 99681. [2025-03-16 19:30:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99681 states, 99680 states have (on average 1.318559390048154) internal successors, (131434), 99680 states have internal predecessors, (131434), 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-16 19:30:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99681 states to 99681 states and 131434 transitions. [2025-03-16 19:30:52,988 INFO L78 Accepts]: Start accepts. Automaton has 99681 states and 131434 transitions. Word has length 100 [2025-03-16 19:30:52,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:30:52,988 INFO L471 AbstractCegarLoop]: Abstraction has 99681 states and 131434 transitions. [2025-03-16 19:30:52,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.037037037037036) internal successors, (244), 26 states have internal predecessors, (244), 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-16 19:30:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 99681 states and 131434 transitions. [2025-03-16 19:30:52,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:30:52,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:30:52,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:30:52,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:30:53,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-16 19:30:53,196 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:30:53,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:30:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1737383159, now seen corresponding path program 1 times [2025-03-16 19:30:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:30:53,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994555732] [2025-03-16 19:30:53,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:30:53,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:53,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:53,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:30:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994555732] [2025-03-16 19:30:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994555732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:30:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87256157] [2025-03-16 19:30:53,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:30:53,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:30:53,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:30:53,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:30:53,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:30:53,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:30:53,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:30:53,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:30:53,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:30:53,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:30:53,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:30:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:54,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:30:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:30:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87256157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:30:55,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:30:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-03-16 19:30:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944312483] [2025-03-16 19:30:55,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:30:55,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:30:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:30:55,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:30:55,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:30:55,180 INFO L87 Difference]: Start difference. First operand 99681 states and 131434 transitions. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 29 states have internal predecessors, (248), 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-16 19:30:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:30:57,682 INFO L93 Difference]: Finished difference Result 455261 states and 597465 transitions. [2025-03-16 19:30:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 19:30:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 29 states have internal predecessors, (248), 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 100 [2025-03-16 19:30:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:30:58,070 INFO L225 Difference]: With dead ends: 455261 [2025-03-16 19:30:58,070 INFO L226 Difference]: Without dead ends: 355681 [2025-03-16 19:30:58,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=887, Invalid=3145, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 19:30:58,168 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1477 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:30:58,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1545 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:30:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355681 states. [2025-03-16 19:31:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355681 to 213219. [2025-03-16 19:31:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213219 states, 213218 states have (on average 1.3055886463619395) internal successors, (278375), 213218 states have internal predecessors, (278375), 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-16 19:31:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213219 states to 213219 states and 278375 transitions. [2025-03-16 19:31:01,294 INFO L78 Accepts]: Start accepts. Automaton has 213219 states and 278375 transitions. Word has length 100 [2025-03-16 19:31:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 213219 states and 278375 transitions. [2025-03-16 19:31:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 29 states have internal predecessors, (248), 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-16 19:31:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 213219 states and 278375 transitions. [2025-03-16 19:31:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:31:01,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:01,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:01,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:31:01,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:01,500 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:31:01,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1919046325, now seen corresponding path program 1 times [2025-03-16 19:31:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:01,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971442414] [2025-03-16 19:31:01,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:01,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:01,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:01,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:01,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:01,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971442414] [2025-03-16 19:31:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971442414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955177827] [2025-03-16 19:31:01,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:01,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:31:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:31:01,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:01,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:01,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:01,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:01,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:31:01,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:02,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955177827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:02,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-16 19:31:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530744629] [2025-03-16 19:31:02,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:31:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:02,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:31:02,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:31:02,762 INFO L87 Difference]: Start difference. First operand 213219 states and 278375 transitions. Second operand has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 18 states have internal predecessors, (251), 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-16 19:31:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:04,107 INFO L93 Difference]: Finished difference Result 467893 states and 611695 transitions. [2025-03-16 19:31:04,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:31:04,107 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 18 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:31:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:04,739 INFO L225 Difference]: With dead ends: 467893 [2025-03-16 19:31:04,739 INFO L226 Difference]: Without dead ends: 368313 [2025-03-16 19:31:04,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:31:04,796 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 595 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:04,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 829 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368313 states. [2025-03-16 19:31:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368313 to 213191. [2025-03-16 19:31:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213191 states, 213190 states have (on average 1.3056287818377972) internal successors, (278347), 213190 states have internal predecessors, (278347), 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-16 19:31:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213191 states to 213191 states and 278347 transitions. [2025-03-16 19:31:08,076 INFO L78 Accepts]: Start accepts. Automaton has 213191 states and 278347 transitions. Word has length 101 [2025-03-16 19:31:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:08,076 INFO L471 AbstractCegarLoop]: Abstraction has 213191 states and 278347 transitions. [2025-03-16 19:31:08,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.210526315789474) internal successors, (251), 18 states have internal predecessors, (251), 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-16 19:31:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 213191 states and 278347 transitions. [2025-03-16 19:31:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:31:08,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:08,079 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:08,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 19:31:08,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:08,280 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:31:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1577172988, now seen corresponding path program 1 times [2025-03-16 19:31:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559859420] [2025-03-16 19:31:08,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:08,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:08,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:08,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:08,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559859420] [2025-03-16 19:31:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559859420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498025030] [2025-03-16 19:31:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:08,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:08,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:31:08,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:31:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:08,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:08,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:08,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 19:31:08,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:10,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498025030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:12,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 45 [2025-03-16 19:31:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518144592] [2025-03-16 19:31:12,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 19:31:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:12,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 19:31:12,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1836, Unknown=0, NotChecked=0, Total=1980 [2025-03-16 19:31:12,632 INFO L87 Difference]: Start difference. First operand 213191 states and 278347 transitions. Second operand has 45 states, 45 states have (on average 6.2) internal successors, (279), 45 states have internal predecessors, (279), 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-16 19:31:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:21,680 INFO L93 Difference]: Finished difference Result 805297 states and 1054513 transitions. [2025-03-16 19:31:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-16 19:31:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.2) internal successors, (279), 45 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:31:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:22,359 INFO L225 Difference]: With dead ends: 805297 [2025-03-16 19:31:22,359 INFO L226 Difference]: Without dead ends: 592207 [2025-03-16 19:31:22,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4643 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1778, Invalid=16582, Unknown=0, NotChecked=0, Total=18360 [2025-03-16 19:31:22,422 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1377 mSDsluCounter, 7583 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 7866 SdHoareTripleChecker+Invalid, 4382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:22,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 7866 Invalid, 4382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 19:31:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592207 states. [2025-03-16 19:31:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592207 to 379733. [2025-03-16 19:31:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379733 states, 379732 states have (on average 1.306192261911032) internal successors, (496003), 379732 states have internal predecessors, (496003), 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-16 19:31:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379733 states to 379733 states and 496003 transitions. [2025-03-16 19:31:28,209 INFO L78 Accepts]: Start accepts. Automaton has 379733 states and 496003 transitions. Word has length 101 [2025-03-16 19:31:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:28,213 INFO L471 AbstractCegarLoop]: Abstraction has 379733 states and 496003 transitions. [2025-03-16 19:31:28,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.2) internal successors, (279), 45 states have internal predecessors, (279), 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-16 19:31:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 379733 states and 496003 transitions. [2025-03-16 19:31:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:31:28,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:28,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:28,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 19:31:28,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-16 19:31:28,419 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-16 19:31:28,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -335180436, now seen corresponding path program 1 times [2025-03-16 19:31:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:28,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876672733] [2025-03-16 19:31:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:28,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:28,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:28,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:28,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876672733] [2025-03-16 19:31:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876672733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555083143] [2025-03-16 19:31:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:28,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:31:28,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:31:28,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:31:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:31:28,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:28,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:28,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:31:28,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:29,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555083143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:29,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-03-16 19:31:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850086907] [2025-03-16 19:31:29,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:29,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:31:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:31:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:31:29,972 INFO L87 Difference]: Start difference. First operand 379733 states and 496003 transitions. Second operand has 29 states, 29 states have (on average 9.96551724137931) internal successors, (289), 28 states have internal predecessors, (289), 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-16 19:31:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:33,949 INFO L93 Difference]: Finished difference Result 986151 states and 1281799 transitions. [2025-03-16 19:31:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-16 19:31:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.96551724137931) internal successors, (289), 28 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:31:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:35,201 INFO L225 Difference]: With dead ends: 986151 [2025-03-16 19:31:35,201 INFO L226 Difference]: Without dead ends: 899779 [2025-03-16 19:31:35,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1625, Invalid=6385, Unknown=0, NotChecked=0, Total=8010 [2025-03-16 19:31:35,331 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2259 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:35,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 1687 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]