./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-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-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:25:16,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:25:16,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:25:16,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:25:16,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:25:16,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:25:16,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:25:16,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:25:16,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:25:16,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:25:16,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:25:16,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:25:16,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:25:16,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:25:16,960 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:25:16,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:25:16,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:25:16,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:25:16,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:25:16,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:25:16,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:25:16,962 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 -> a7994e4b0bfbe275d233e5a25c7b22888e2d55ba388328f1fc4435f77ac9412d [2025-03-16 19:25:17,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:25:17,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:25:17,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:25:17,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:25:17,189 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:25:17,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:25:18,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3a7ad04/a307b5a133454594a0221cf402573841/FLAGfe7b24609 [2025-03-16 19:25:18,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:25:18,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:25:18,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3a7ad04/a307b5a133454594a0221cf402573841/FLAGfe7b24609 [2025-03-16 19:25:18,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3a7ad04/a307b5a133454594a0221cf402573841 [2025-03-16 19:25:18,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:25:18,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:25:18,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:25:18,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:25:18,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:25:18,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:25:18" (1/1) ... [2025-03-16 19:25:18,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a92815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:18, skipping insertion in model container [2025-03-16 19:25:18,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:25:18" (1/1) ... [2025-03-16 19:25:18,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:25:19,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2025-03-16 19:25:19,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:25:19,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:25:19,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4409,4422] [2025-03-16 19:25:19,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:25:19,139 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:25:19,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19 WrapperNode [2025-03-16 19:25:19,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:25:19,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:25:19,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:25:19,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:25:19,145 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:25:19" (1/1) ... [2025-03-16 19:25:19,150 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:25:19" (1/1) ... [2025-03-16 19:25:19,172 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 361 [2025-03-16 19:25:19,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:25:19,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:25:19,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:25:19,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:25:19,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,197 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:25:19,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:25:19,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:25:19,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:25:19,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:25:19,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (1/1) ... [2025-03-16 19:25:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:25:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:19,235 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:25:19,238 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:25:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:25:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:25:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:25:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:25:19,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:25:19,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L476: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc main_~node2__m2~0#1; [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:19,621 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L172: havoc main_~node3__m3~0#1; [2025-03-16 19:25:19,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:25:19,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:25:19,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:25:19,622 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:25:19,635 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-16 19:25:19,635 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:25:19,644 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:25:19,644 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:25:19,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:25:19 BoogieIcfgContainer [2025-03-16 19:25:19,645 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:25:19,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:25:19,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:25:19,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:25:19,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:25:18" (1/3) ... [2025-03-16 19:25:19,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51de872d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:25:19, skipping insertion in model container [2025-03-16 19:25:19,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:25:19" (2/3) ... [2025-03-16 19:25:19,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51de872d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:25:19, skipping insertion in model container [2025-03-16 19:25:19,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:25:19" (3/3) ... [2025-03-16 19:25:19,651 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:25:19,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:25:19,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 86 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:25:19,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:25:19,699 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;@6d70325c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:25:19,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:25:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 85 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:25:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 19:25:19,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:19,706 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] [2025-03-16 19:25:19,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -721559982, now seen corresponding path program 1 times [2025-03-16 19:25:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386838087] [2025-03-16 19:25:19,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:19,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 19:25:19,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 19:25:19,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:19,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:20,000 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:25:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386838087] [2025-03-16 19:25:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386838087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:20,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:20,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268800045] [2025-03-16 19:25:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:20,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:20,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:20,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:20,019 INFO L87 Difference]: Start difference. First operand has 86 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 85 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:25:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:20,062 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2025-03-16 19:25:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:20,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-16 19:25:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:20,069 INFO L225 Difference]: With dead ends: 204 [2025-03-16 19:25:20,069 INFO L226 Difference]: Without dead ends: 131 [2025-03-16 19:25:20,071 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:25:20,073 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:20,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-16 19:25:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-16 19:25:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.5078125) internal successors, (193), 128 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:25:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2025-03-16 19:25:20,107 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 37 [2025-03-16 19:25:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:20,107 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2025-03-16 19:25:20,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 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:25:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2025-03-16 19:25:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 19:25:20,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:20,109 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] [2025-03-16 19:25:20,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:25:20,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:20,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 824834605, now seen corresponding path program 1 times [2025-03-16 19:25:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:20,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-16 19:25:20,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 19:25:20,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 19:25:20,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:20,221 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:25:20,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235744029] [2025-03-16 19:25:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235744029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394497296] [2025-03-16 19:25:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:20,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:20,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:20,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:20,224 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:25:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:20,251 INFO L93 Difference]: Finished difference Result 317 states and 489 transitions. [2025-03-16 19:25:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-16 19:25:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:20,254 INFO L225 Difference]: With dead ends: 317 [2025-03-16 19:25:20,255 INFO L226 Difference]: Without dead ends: 207 [2025-03-16 19:25:20,255 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:25:20,256 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:20,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-16 19:25:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2025-03-16 19:25:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.5294117647058822) internal successors, (312), 204 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:25:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2025-03-16 19:25:20,264 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 38 [2025-03-16 19:25:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2025-03-16 19:25:20,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:25:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2025-03-16 19:25:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 19:25:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:20,265 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] [2025-03-16 19:25:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:25:20,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:20,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2090214516, now seen corresponding path program 1 times [2025-03-16 19:25:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396366476] [2025-03-16 19:25:20,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 19:25:20,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 19:25:20,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:20,407 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:25:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396366476] [2025-03-16 19:25:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396366476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679652360] [2025-03-16 19:25:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:20,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:20,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:20,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:20,408 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:25:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:20,481 INFO L93 Difference]: Finished difference Result 949 states and 1484 transitions. [2025-03-16 19:25:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-16 19:25:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:20,486 INFO L225 Difference]: With dead ends: 949 [2025-03-16 19:25:20,486 INFO L226 Difference]: Without dead ends: 763 [2025-03-16 19:25:20,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:25:20,491 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 501 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:20,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 696 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-16 19:25:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 389. [2025-03-16 19:25:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.5360824742268042) internal successors, (596), 388 states have internal predecessors, (596), 0 states have call successors, (0), 0 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:25:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 596 transitions. [2025-03-16 19:25:20,516 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 596 transitions. Word has length 39 [2025-03-16 19:25:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:20,516 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 596 transitions. [2025-03-16 19:25:20,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:25:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 596 transitions. [2025-03-16 19:25:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:25:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:20,517 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] [2025-03-16 19:25:20,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:25:20,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:20,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -371185251, now seen corresponding path program 1 times [2025-03-16 19:25:20,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-03-16 19:25:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:20,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:25:20,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:25:20,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:20,672 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:25:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:20,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-03-16 19:25:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529395423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827030066] [2025-03-16 19:25:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:20,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:20,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:20,674 INFO L87 Difference]: Start difference. First operand 389 states and 596 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:25:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:20,729 INFO L93 Difference]: Finished difference Result 1347 states and 2079 transitions. [2025-03-16 19:25:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:20,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 19:25:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:20,734 INFO L225 Difference]: With dead ends: 1347 [2025-03-16 19:25:20,734 INFO L226 Difference]: Without dead ends: 977 [2025-03-16 19:25:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:20,738 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 253 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:20,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 405 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-16 19:25:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2025-03-16 19:25:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.5349794238683128) internal successors, (1492), 972 states have internal predecessors, (1492), 0 states have call successors, (0), 0 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:25:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1492 transitions. [2025-03-16 19:25:20,769 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1492 transitions. Word has length 40 [2025-03-16 19:25:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:20,770 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1492 transitions. [2025-03-16 19:25:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:25:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1492 transitions. [2025-03-16 19:25:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 19:25:20,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:20,771 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] [2025-03-16 19:25:20,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:25:20,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:20,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:20,772 INFO L85 PathProgramCache]: Analyzing trace with hash 321749784, now seen corresponding path program 1 times [2025-03-16 19:25:20,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-03-16 19:25:20,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:20,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 19:25:20,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 19:25:20,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:20,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:20,827 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:25:20,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972665355] [2025-03-16 19:25:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972665355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783298662] [2025-03-16 19:25:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:20,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:20,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:20,828 INFO L87 Difference]: Start difference. First operand 973 states and 1492 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:25:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:20,846 INFO L93 Difference]: Finished difference Result 2489 states and 3806 transitions. [2025-03-16 19:25:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-16 19:25:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:20,851 INFO L225 Difference]: With dead ends: 2489 [2025-03-16 19:25:20,851 INFO L226 Difference]: Without dead ends: 1535 [2025-03-16 19:25:20,852 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:25:20,853 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 274 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-03-16 19:25:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1533. [2025-03-16 19:25:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.5065274151436032) internal successors, (2308), 1532 states have internal predecessors, (2308), 0 states have call successors, (0), 0 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:25:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2308 transitions. [2025-03-16 19:25:20,878 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2308 transitions. Word has length 41 [2025-03-16 19:25:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2308 transitions. [2025-03-16 19:25:20,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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:25:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2308 transitions. [2025-03-16 19:25:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:25:20,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:20,880 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] [2025-03-16 19:25:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:25:20,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -223219265, now seen corresponding path program 1 times [2025-03-16 19:25:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-16 19:25:20,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:20,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:25:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:25:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:21,118 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:25:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-16 19:25:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867817005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863105508] [2025-03-16 19:25:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:21,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:21,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:21,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:21,119 INFO L87 Difference]: Start difference. First operand 1533 states and 2308 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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:25:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:21,145 INFO L93 Difference]: Finished difference Result 1631 states and 2453 transitions. [2025-03-16 19:25:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-16 19:25:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:21,150 INFO L225 Difference]: With dead ends: 1631 [2025-03-16 19:25:21,150 INFO L226 Difference]: Without dead ends: 1629 [2025-03-16 19:25:21,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:21,152 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:21,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-16 19:25:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2025-03-16 19:25:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1628 states have (on average 1.4766584766584767) internal successors, (2404), 1628 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:25:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2404 transitions. [2025-03-16 19:25:21,189 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2404 transitions. Word has length 42 [2025-03-16 19:25:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:21,189 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2404 transitions. [2025-03-16 19:25:21,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 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:25:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2404 transitions. [2025-03-16 19:25:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:25:21,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:21,192 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] [2025-03-16 19:25:21,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:25:21,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:21,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1674905930, now seen corresponding path program 1 times [2025-03-16 19:25:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:21,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330145705] [2025-03-16 19:25:21,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:25:21,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:25:21,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:21,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:21,264 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:25:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330145705] [2025-03-16 19:25:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330145705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271014928] [2025-03-16 19:25:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:21,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:21,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:21,267 INFO L87 Difference]: Start difference. First operand 1629 states and 2404 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:25:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:21,293 INFO L93 Difference]: Finished difference Result 3951 states and 5840 transitions. [2025-03-16 19:25:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:21,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-16 19:25:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:21,300 INFO L225 Difference]: With dead ends: 3951 [2025-03-16 19:25:21,300 INFO L226 Difference]: Without dead ends: 2341 [2025-03-16 19:25:21,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:21,303 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 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:25:21,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2025-03-16 19:25:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2319. [2025-03-16 19:25:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 2318 states have (on average 1.4641932700603968) internal successors, (3394), 2318 states have internal predecessors, (3394), 0 states have call successors, (0), 0 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:25:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3394 transitions. [2025-03-16 19:25:21,339 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3394 transitions. Word has length 43 [2025-03-16 19:25:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:21,339 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3394 transitions. [2025-03-16 19:25:21,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:25:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3394 transitions. [2025-03-16 19:25:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:25:21,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:21,341 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] [2025-03-16 19:25:21,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:25:21,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:21,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash -57980668, now seen corresponding path program 1 times [2025-03-16 19:25:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198705995] [2025-03-16 19:25:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:21,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:25:21,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:25:21,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:21,686 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:25:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198705995] [2025-03-16 19:25:21,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198705995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629477503] [2025-03-16 19:25:21,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:21,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:21,691 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:25:21,692 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:25:21,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:25:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:25:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:21,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:25:21,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:22,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629477503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:22,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:25:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896203057] [2025-03-16 19:25:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:22,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 19:25:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:22,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 19:25:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:25:22,823 INFO L87 Difference]: Start difference. First operand 2319 states and 3394 transitions. Second operand has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:25:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:26,968 INFO L93 Difference]: Finished difference Result 14879 states and 21686 transitions. [2025-03-16 19:25:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-16 19:25:26,968 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:25:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:26,998 INFO L225 Difference]: With dead ends: 14879 [2025-03-16 19:25:26,998 INFO L226 Difference]: Without dead ends: 12581 [2025-03-16 19:25:27,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5578 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2723, Invalid=12039, Unknown=0, NotChecked=0, Total=14762 [2025-03-16 19:25:27,005 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 6000 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6000 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:27,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6000 Valid, 1355 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:25:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12581 states. [2025-03-16 19:25:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12581 to 10259. [2025-03-16 19:25:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10259 states, 10258 states have (on average 1.4381945798401248) internal successors, (14753), 10258 states have internal predecessors, (14753), 0 states have call successors, (0), 0 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:25:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10259 states to 10259 states and 14753 transitions. [2025-03-16 19:25:27,161 INFO L78 Accepts]: Start accepts. Automaton has 10259 states and 14753 transitions. Word has length 62 [2025-03-16 19:25:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:27,161 INFO L471 AbstractCegarLoop]: Abstraction has 10259 states and 14753 transitions. [2025-03-16 19:25:27,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 22 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:25:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10259 states and 14753 transitions. [2025-03-16 19:25:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:25:27,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:27,203 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:27,210 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:25:27,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:27,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash 771011922, now seen corresponding path program 1 times [2025-03-16 19:25:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388709083] [2025-03-16 19:25:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:27,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:25:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:25:27,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:27,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388709083] [2025-03-16 19:25:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388709083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446437812] [2025-03-16 19:25:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:27,459 INFO L87 Difference]: Start difference. First operand 10259 states and 14753 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:27,502 INFO L93 Difference]: Finished difference Result 23534 states and 33740 transitions. [2025-03-16 19:25:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:25:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:27,541 INFO L225 Difference]: With dead ends: 23534 [2025-03-16 19:25:27,541 INFO L226 Difference]: Without dead ends: 16230 [2025-03-16 19:25:27,551 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:25:27,551 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:27,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16230 states. [2025-03-16 19:25:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16230 to 16228. [2025-03-16 19:25:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16228 states, 16227 states have (on average 1.4164047575029273) internal successors, (22984), 16227 states have internal predecessors, (22984), 0 states have call successors, (0), 0 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:25:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16228 states to 16228 states and 22984 transitions. [2025-03-16 19:25:27,819 INFO L78 Accepts]: Start accepts. Automaton has 16228 states and 22984 transitions. Word has length 63 [2025-03-16 19:25:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 16228 states and 22984 transitions. [2025-03-16 19:25:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 16228 states and 22984 transitions. [2025-03-16 19:25:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:25:27,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:27,824 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:27,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:25:27,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:27,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2107037840, now seen corresponding path program 1 times [2025-03-16 19:25:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438975966] [2025-03-16 19:25:27,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:27,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:25:27,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:25:27,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:27,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:25:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438975966] [2025-03-16 19:25:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438975966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634353578] [2025-03-16 19:25:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:27,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:27,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:27,894 INFO L87 Difference]: Start difference. First operand 16228 states and 22984 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:27,968 INFO L93 Difference]: Finished difference Result 32605 states and 46558 transitions. [2025-03-16 19:25:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:25:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:28,012 INFO L225 Difference]: With dead ends: 32605 [2025-03-16 19:25:28,012 INFO L226 Difference]: Without dead ends: 26047 [2025-03-16 19:25:28,026 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:25:28,027 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 349 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:28,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 590 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26047 states. [2025-03-16 19:25:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26047 to 22573. [2025-03-16 19:25:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22573 states, 22572 states have (on average 1.4124579124579124) internal successors, (31882), 22572 states have internal predecessors, (31882), 0 states have call successors, (0), 0 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:25:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22573 states to 22573 states and 31882 transitions. [2025-03-16 19:25:28,347 INFO L78 Accepts]: Start accepts. Automaton has 22573 states and 31882 transitions. Word has length 63 [2025-03-16 19:25:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:28,347 INFO L471 AbstractCegarLoop]: Abstraction has 22573 states and 31882 transitions. [2025-03-16 19:25:28,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22573 states and 31882 transitions. [2025-03-16 19:25:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:25:28,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:28,350 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:25:28,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:28,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1585903242, now seen corresponding path program 1 times [2025-03-16 19:25:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:28,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901290545] [2025-03-16 19:25:28,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:25:28,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:25:28,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:28,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:28,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901290545] [2025-03-16 19:25:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901290545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400845113] [2025-03-16 19:25:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:28,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:28,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:28,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:28,406 INFO L87 Difference]: Start difference. First operand 22573 states and 31882 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:28,473 INFO L93 Difference]: Finished difference Result 36996 states and 52140 transitions. [2025-03-16 19:25:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:25:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:28,506 INFO L225 Difference]: With dead ends: 36996 [2025-03-16 19:25:28,507 INFO L226 Difference]: Without dead ends: 22754 [2025-03-16 19:25:28,524 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:25:28,525 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:28,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22754 states. [2025-03-16 19:25:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22754 to 20392. [2025-03-16 19:25:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20392 states, 20391 states have (on average 1.3891913098916189) internal successors, (28327), 20391 states have internal predecessors, (28327), 0 states have call successors, (0), 0 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:25:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20392 states to 20392 states and 28327 transitions. [2025-03-16 19:25:28,772 INFO L78 Accepts]: Start accepts. Automaton has 20392 states and 28327 transitions. Word has length 63 [2025-03-16 19:25:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:28,772 INFO L471 AbstractCegarLoop]: Abstraction has 20392 states and 28327 transitions. [2025-03-16 19:25:28,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20392 states and 28327 transitions. [2025-03-16 19:25:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:25:28,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:28,774 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:28,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:25:28,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2124075890, now seen corresponding path program 1 times [2025-03-16 19:25:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790250857] [2025-03-16 19:25:28,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:28,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:25:28,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:25:28,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:28,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:25:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790250857] [2025-03-16 19:25:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790250857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579978160] [2025-03-16 19:25:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:28,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:28,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:28,853 INFO L87 Difference]: Start difference. First operand 20392 states and 28327 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:28,939 INFO L93 Difference]: Finished difference Result 36728 states and 51589 transitions. [2025-03-16 19:25:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:25:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:28,982 INFO L225 Difference]: With dead ends: 36728 [2025-03-16 19:25:28,982 INFO L226 Difference]: Without dead ends: 29561 [2025-03-16 19:25:28,994 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:25:28,995 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 347 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:28,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 576 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29561 states. [2025-03-16 19:25:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29561 to 26053. [2025-03-16 19:25:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26053 states, 26052 states have (on average 1.3849608475356978) internal successors, (36081), 26052 states have internal predecessors, (36081), 0 states have call successors, (0), 0 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:25:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26053 states to 26053 states and 36081 transitions. [2025-03-16 19:25:29,361 INFO L78 Accepts]: Start accepts. Automaton has 26053 states and 36081 transitions. Word has length 63 [2025-03-16 19:25:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:29,361 INFO L471 AbstractCegarLoop]: Abstraction has 26053 states and 36081 transitions. [2025-03-16 19:25:29,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 26053 states and 36081 transitions. [2025-03-16 19:25:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:25:29,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:29,365 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:25:29,365 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2128543094, now seen corresponding path program 1 times [2025-03-16 19:25:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882735794] [2025-03-16 19:25:29,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:25:29,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:25:29,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:29,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:25:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882735794] [2025-03-16 19:25:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882735794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245548514] [2025-03-16 19:25:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:29,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:29,428 INFO L87 Difference]: Start difference. First operand 26053 states and 36081 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:29,520 INFO L93 Difference]: Finished difference Result 36375 states and 50917 transitions. [2025-03-16 19:25:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:25:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:25:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:29,635 INFO L225 Difference]: With dead ends: 36375 [2025-03-16 19:25:29,635 INFO L226 Difference]: Without dead ends: 32909 [2025-03-16 19:25:29,645 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:25:29,646 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 353 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:29,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 574 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32909 states. [2025-03-16 19:25:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32909 to 29411. [2025-03-16 19:25:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29411 states, 29410 states have (on average 1.3869092145528732) internal successors, (40789), 29410 states have internal predecessors, (40789), 0 states have call successors, (0), 0 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:25:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29411 states to 29411 states and 40789 transitions. [2025-03-16 19:25:30,161 INFO L78 Accepts]: Start accepts. Automaton has 29411 states and 40789 transitions. Word has length 64 [2025-03-16 19:25:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:30,162 INFO L471 AbstractCegarLoop]: Abstraction has 29411 states and 40789 transitions. [2025-03-16 19:25:30,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 29411 states and 40789 transitions. [2025-03-16 19:25:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:25:30,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:30,164 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:30,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:25:30,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:30,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:30,165 INFO L85 PathProgramCache]: Analyzing trace with hash -403726690, now seen corresponding path program 1 times [2025-03-16 19:25:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685972840] [2025-03-16 19:25:30,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:30,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:30,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:25:30,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:25:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685972840] [2025-03-16 19:25:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685972840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383567229] [2025-03-16 19:25:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:30,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:30,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:30,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:30,288 INFO L87 Difference]: Start difference. First operand 29411 states and 40789 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:30,380 INFO L93 Difference]: Finished difference Result 71916 states and 99364 transitions. [2025-03-16 19:25:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:30,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:25:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:30,433 INFO L225 Difference]: With dead ends: 71916 [2025-03-16 19:25:30,433 INFO L226 Difference]: Without dead ends: 44381 [2025-03-16 19:25:30,462 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:25:30,463 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:30,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 266 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44381 states. [2025-03-16 19:25:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44381 to 42551. [2025-03-16 19:25:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42551 states, 42550 states have (on average 1.3662514688601646) internal successors, (58134), 42550 states have internal predecessors, (58134), 0 states have call successors, (0), 0 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:25:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42551 states to 42551 states and 58134 transitions. [2025-03-16 19:25:30,911 INFO L78 Accepts]: Start accepts. Automaton has 42551 states and 58134 transitions. Word has length 66 [2025-03-16 19:25:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:30,911 INFO L471 AbstractCegarLoop]: Abstraction has 42551 states and 58134 transitions. [2025-03-16 19:25:30,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 42551 states and 58134 transitions. [2025-03-16 19:25:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:25:30,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:30,914 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:30,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:25:30,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -951748774, now seen corresponding path program 1 times [2025-03-16 19:25:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760797816] [2025-03-16 19:25:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:30,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:25:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:25:30,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:30,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760797816] [2025-03-16 19:25:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760797816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58878758] [2025-03-16 19:25:30,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:30,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:30,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:30,997 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:25:30,999 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:25:31,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:25:31,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:25:31,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:31,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:31,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:25:31,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:31,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58878758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:31,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:25:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773066208] [2025-03-16 19:25:31,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:25:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:31,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:25:31,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:25:31,309 INFO L87 Difference]: Start difference. First operand 42551 states and 58134 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:25:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:31,741 INFO L93 Difference]: Finished difference Result 84993 states and 116355 transitions. [2025-03-16 19:25:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:25:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:25:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:31,805 INFO L225 Difference]: With dead ends: 84993 [2025-03-16 19:25:31,805 INFO L226 Difference]: Without dead ends: 64571 [2025-03-16 19:25:31,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:25:31,830 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1170 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:31,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 324 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:25:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64571 states. [2025-03-16 19:25:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64571 to 50489. [2025-03-16 19:25:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50489 states, 50488 states have (on average 1.3624623672951988) internal successors, (68788), 50488 states have internal predecessors, (68788), 0 states have call successors, (0), 0 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:25:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50489 states to 50489 states and 68788 transitions. [2025-03-16 19:25:32,556 INFO L78 Accepts]: Start accepts. Automaton has 50489 states and 68788 transitions. Word has length 68 [2025-03-16 19:25:32,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:32,557 INFO L471 AbstractCegarLoop]: Abstraction has 50489 states and 68788 transitions. [2025-03-16 19:25:32,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:25:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 50489 states and 68788 transitions. [2025-03-16 19:25:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:25:32,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:32,563 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:32,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:25:32,763 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,SelfDestructingSolverStorable14 [2025-03-16 19:25:32,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:32,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:32,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1398163012, now seen corresponding path program 1 times [2025-03-16 19:25:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267656202] [2025-03-16 19:25:32,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:32,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:25:32,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:25:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:32,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267656202] [2025-03-16 19:25:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267656202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601982803] [2025-03-16 19:25:32,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:32,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:32,858 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:25:32,859 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:25:32,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:25:32,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:25:32,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:32,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:32,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:25:32,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:33,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601982803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:33,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:25:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620822920] [2025-03-16 19:25:33,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:33,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:25:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:33,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:25:33,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:25:33,147 INFO L87 Difference]: Start difference. First operand 50489 states and 68788 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:33,541 INFO L93 Difference]: Finished difference Result 107463 states and 146117 transitions. [2025-03-16 19:25:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:25:33,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:25:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:33,592 INFO L225 Difference]: With dead ends: 107463 [2025-03-16 19:25:33,593 INFO L226 Difference]: Without dead ends: 58252 [2025-03-16 19:25:33,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:25:33,607 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 868 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:33,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 238 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58252 states. [2025-03-16 19:25:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58252 to 51477. [2025-03-16 19:25:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51477 states, 51476 states have (on average 1.3557968762141581) internal successors, (69791), 51476 states have internal predecessors, (69791), 0 states have call successors, (0), 0 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:25:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51477 states to 51477 states and 69791 transitions. [2025-03-16 19:25:34,123 INFO L78 Accepts]: Start accepts. Automaton has 51477 states and 69791 transitions. Word has length 68 [2025-03-16 19:25:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:34,123 INFO L471 AbstractCegarLoop]: Abstraction has 51477 states and 69791 transitions. [2025-03-16 19:25:34,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51477 states and 69791 transitions. [2025-03-16 19:25:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:25:34,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:34,126 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:34,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:25:34,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:34,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1799351760, now seen corresponding path program 1 times [2025-03-16 19:25:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974190670] [2025-03-16 19:25:34,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:34,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:25:34,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:25:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974190670] [2025-03-16 19:25:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974190670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493988823] [2025-03-16 19:25:34,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:34,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:34,404 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:25:34,406 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:25:34,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:25:34,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:25:34,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:34,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:34,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:25:34,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:34,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493988823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:34,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:25:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370089327] [2025-03-16 19:25:34,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:34,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:25:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:34,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:25:34,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:25:34,687 INFO L87 Difference]: Start difference. First operand 51477 states and 69791 transitions. Second operand has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:35,131 INFO L93 Difference]: Finished difference Result 138399 states and 188663 transitions. [2025-03-16 19:25:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:25:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:25:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:35,221 INFO L225 Difference]: With dead ends: 138399 [2025-03-16 19:25:35,222 INFO L226 Difference]: Without dead ends: 91314 [2025-03-16 19:25:35,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:25:35,253 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 908 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:35,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 259 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91314 states. [2025-03-16 19:25:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91314 to 59738. [2025-03-16 19:25:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59738 states, 59737 states have (on average 1.3581532383614845) internal successors, (81132), 59737 states have internal predecessors, (81132), 0 states have call successors, (0), 0 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:25:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59738 states to 59738 states and 81132 transitions. [2025-03-16 19:25:36,053 INFO L78 Accepts]: Start accepts. Automaton has 59738 states and 81132 transitions. Word has length 69 [2025-03-16 19:25:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:36,053 INFO L471 AbstractCegarLoop]: Abstraction has 59738 states and 81132 transitions. [2025-03-16 19:25:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.727272727272727) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 59738 states and 81132 transitions. [2025-03-16 19:25:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:25:36,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:36,056 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:36,062 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:25:36,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 19:25:36,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:36,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1774679006, now seen corresponding path program 1 times [2025-03-16 19:25:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769752780] [2025-03-16 19:25:36,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:36,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:25:36,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:25:36,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769752780] [2025-03-16 19:25:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769752780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407858861] [2025-03-16 19:25:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:36,443 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:25:36,445 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:25:36,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:25:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:25:36,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:36,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:36,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 19:25:36,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:38,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407858861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:39,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:39,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 20] total 44 [2025-03-16 19:25:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427823480] [2025-03-16 19:25:39,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:39,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 19:25:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:39,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 19:25:39,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 19:25:39,690 INFO L87 Difference]: Start difference. First operand 59738 states and 81132 transitions. Second operand has 44 states, 44 states have (on average 4.409090909090909) internal successors, (194), 44 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)