./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a76dc897aa0702a7581955a590e68a0e3d7c15bffbb5939a80772bf70ad5d7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:42:52,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:42:52,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:42:52,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:42:52,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:42:52,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:42:52,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:42:52,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:42:52,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:42:52,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:42:52,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:42:52,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:42:52,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:42:52,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:42:52,488 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:42:52,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:42:52,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:42:52,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:42:52,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:42:52,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:42:52,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:52,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:42:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:52,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:42:52,491 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a76dc897aa0702a7581955a590e68a0e3d7c15bffbb5939a80772bf70ad5d7a [2025-01-09 04:42:52,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:42:52,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:42:52,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:42:52,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:42:52,740 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:42:52,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:53,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e43c87f64/2cccd91d46174cda82f23c0761cbe353/FLAG05b01139d [2025-01-09 04:42:54,321 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:42:54,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:54,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e43c87f64/2cccd91d46174cda82f23c0761cbe353/FLAG05b01139d [2025-01-09 04:42:54,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e43c87f64/2cccd91d46174cda82f23c0761cbe353 [2025-01-09 04:42:54,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:42:54,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:42:54,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:54,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:42:54,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:42:54,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:54" (1/1) ... [2025-01-09 04:42:54,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:54, skipping insertion in model container [2025-01-09 04:42:54,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:54" (1/1) ... [2025-01-09 04:42:54,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:42:54,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[10634,10647] [2025-01-09 04:42:54,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[25860,25873] [2025-01-09 04:42:54,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:54,862 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:42:54,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[10634,10647] [2025-01-09 04:42:54,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[25860,25873] [2025-01-09 04:42:55,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:42:55,053 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:42:55,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55 WrapperNode [2025-01-09 04:42:55,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:42:55,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:55,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:42:55,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:42:55,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,201 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3884 [2025-01-09 04:42:55,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:42:55,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:42:55,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:42:55,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:42:55,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,262 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:42:55,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:42:55,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:42:55,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:42:55,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:42:55,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (1/1) ... [2025-01-09 04:42:55,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:42:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:42:55,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:42:55,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:42:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:42:55,630 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:42:55,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:42:57,315 INFO L? ?]: Removed 589 outVars from TransFormulas that were not future-live. [2025-01-09 04:42:57,316 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:42:57,355 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:42:57,355 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:42:57,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:57 BoogieIcfgContainer [2025-01-09 04:42:57,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:42:57,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:42:57,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:42:57,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:42:57,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:54" (1/3) ... [2025-01-09 04:42:57,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609ac00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:57, skipping insertion in model container [2025-01-09 04:42:57,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:55" (2/3) ... [2025-01-09 04:42:57,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609ac00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:57, skipping insertion in model container [2025-01-09 04:42:57,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:57" (3/3) ... [2025-01-09 04:42:57,373 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:42:57,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:42:57,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 705 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 04:42:57,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:42:57,465 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;@34cefbef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:42:57,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 04:42:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 705 states, 702 states have (on average 1.7834757834757835) internal successors, (1252), 704 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:42:57,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:57,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:57,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:42:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -377035951, now seen corresponding path program 1 times [2025-01-09 04:42:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588932704] [2025-01-09 04:42:57,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:57,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:42:57,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:42:57,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588932704] [2025-01-09 04:42:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588932704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:57,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468613403] [2025-01-09 04:42:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:57,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:57,822 INFO L87 Difference]: Start difference. First operand has 705 states, 702 states have (on average 1.7834757834757835) internal successors, (1252), 704 states have internal predecessors, (1252), 0 states have call successors, (0), 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 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-01-09 04:42:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:57,916 INFO L93 Difference]: Finished difference Result 1069 states and 1856 transitions. [2025-01-09 04:42:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:57,918 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-01-09 04:42:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:57,929 INFO L225 Difference]: With dead ends: 1069 [2025-01-09 04:42:57,929 INFO L226 Difference]: Without dead ends: 846 [2025-01-09 04:42:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:57,933 INFO L435 NwaCegarLoop]: 1250 mSDtfsCounter, 631 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:57,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2079 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-01-09 04:42:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2025-01-09 04:42:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 842 states have (on average 1.368171021377672) internal successors, (1152), 843 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1152 transitions. [2025-01-09 04:42:57,995 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1152 transitions. Word has length 63 [2025-01-09 04:42:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:57,995 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1152 transitions. [2025-01-09 04:42:57,996 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-01-09 04:42:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1152 transitions. [2025-01-09 04:42:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:58,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:58,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:58,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:42:58,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:42:58,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 714072948, now seen corresponding path program 1 times [2025-01-09 04:42:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:58,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213069998] [2025-01-09 04:42:58,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:58,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:58,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:58,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:58,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213069998] [2025-01-09 04:42:58,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213069998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:58,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:58,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:58,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600679258] [2025-01-09 04:42:58,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:58,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:58,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:58,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:58,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:58,197 INFO L87 Difference]: Start difference. First operand 844 states and 1152 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:58,437 INFO L93 Difference]: Finished difference Result 1471 states and 2026 transitions. [2025-01-09 04:42:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:58,446 INFO L225 Difference]: With dead ends: 1471 [2025-01-09 04:42:58,446 INFO L226 Difference]: Without dead ends: 1228 [2025-01-09 04:42:58,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:58,450 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 549 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:58,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1683 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:42:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-01-09 04:42:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2025-01-09 04:42:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1222 states have (on average 1.3543371522094927) internal successors, (1655), 1223 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1655 transitions. [2025-01-09 04:42:58,490 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1655 transitions. Word has length 64 [2025-01-09 04:42:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:58,490 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1655 transitions. [2025-01-09 04:42:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1655 transitions. [2025-01-09 04:42:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:42:58,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:58,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:42:58,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:42:58,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1908609010, now seen corresponding path program 1 times [2025-01-09 04:42:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376638269] [2025-01-09 04:42:58,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:58,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:42:58,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:42:58,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:58,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376638269] [2025-01-09 04:42:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376638269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:42:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685485726] [2025-01-09 04:42:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:58,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:42:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:42:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:42:58,708 INFO L87 Difference]: Start difference. First operand 1224 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:59,142 INFO L93 Difference]: Finished difference Result 2482 states and 3457 transitions. [2025-01-09 04:42:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:42:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:42:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:59,151 INFO L225 Difference]: With dead ends: 2482 [2025-01-09 04:42:59,151 INFO L226 Difference]: Without dead ends: 1483 [2025-01-09 04:42:59,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:42:59,156 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2610 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:59,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 575 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:42:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2025-01-09 04:42:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2025-01-09 04:42:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1479 states have (on average 1.3955375253549696) internal successors, (2064), 1480 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2064 transitions. [2025-01-09 04:42:59,206 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2064 transitions. Word has length 64 [2025-01-09 04:42:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:59,210 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2064 transitions. [2025-01-09 04:42:59,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2064 transitions. [2025-01-09 04:42:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:42:59,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:59,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:59,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:42:59,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:42:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1292035188, now seen corresponding path program 1 times [2025-01-09 04:42:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001523572] [2025-01-09 04:42:59,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:59,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:42:59,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:42:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:59,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:59,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001523572] [2025-01-09 04:42:59,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001523572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:59,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:59,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263323839] [2025-01-09 04:42:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:59,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:59,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:59,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:59,402 INFO L87 Difference]: Start difference. First operand 1481 states and 2064 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:59,469 INFO L93 Difference]: Finished difference Result 2949 states and 4174 transitions. [2025-01-09 04:42:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:42:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:59,480 INFO L225 Difference]: With dead ends: 2949 [2025-01-09 04:42:59,483 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 04:42:59,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:59,486 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 578 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:59,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1484 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:42:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 04:42:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2068. [2025-01-09 04:42:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2066 states have (on average 1.3799612778315586) internal successors, (2851), 2067 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2851 transitions. [2025-01-09 04:42:59,587 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2851 transitions. Word has length 65 [2025-01-09 04:42:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:42:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 2851 transitions. [2025-01-09 04:42:59,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:42:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2851 transitions. [2025-01-09 04:42:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:42:59,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:42:59,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:42:59,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:42:59,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:42:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:42:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1184582392, now seen corresponding path program 1 times [2025-01-09 04:42:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:42:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825067556] [2025-01-09 04:42:59,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:42:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:42:59,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:42:59,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:42:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:42:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:42:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:42:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:42:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825067556] [2025-01-09 04:42:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825067556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:42:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:42:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:42:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296859538] [2025-01-09 04:42:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:42:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:42:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:42:59,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:42:59,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:59,749 INFO L87 Difference]: Start difference. First operand 2068 states and 2851 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-01-09 04:42:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:42:59,859 INFO L93 Difference]: Finished difference Result 4442 states and 6243 transitions. [2025-01-09 04:42:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:42:59,863 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-01-09 04:42:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:42:59,880 INFO L225 Difference]: With dead ends: 4442 [2025-01-09 04:42:59,885 INFO L226 Difference]: Without dead ends: 3159 [2025-01-09 04:42:59,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:42:59,895 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 396 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:42:59,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1441 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:42:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2025-01-09 04:42:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 3155. [2025-01-09 04:43:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 3153 states have (on average 1.3799555978433238) internal successors, (4351), 3154 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 4351 transitions. [2025-01-09 04:43:00,019 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 4351 transitions. Word has length 66 [2025-01-09 04:43:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:00,019 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 4351 transitions. [2025-01-09 04:43:00,019 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-01-09 04:43:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 4351 transitions. [2025-01-09 04:43:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:43:00,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:00,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:00,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:43:00,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:00,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash -237880367, now seen corresponding path program 1 times [2025-01-09 04:43:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538915269] [2025-01-09 04:43:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:00,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:43:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:43:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538915269] [2025-01-09 04:43:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538915269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169973049] [2025-01-09 04:43:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:00,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:00,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:00,126 INFO L87 Difference]: Start difference. First operand 3155 states and 4351 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-01-09 04:43:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:00,468 INFO L93 Difference]: Finished difference Result 6802 states and 9465 transitions. [2025-01-09 04:43:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-01-09 04:43:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:00,478 INFO L225 Difference]: With dead ends: 6802 [2025-01-09 04:43:00,478 INFO L226 Difference]: Without dead ends: 3982 [2025-01-09 04:43:00,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:00,481 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 2282 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:00,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 522 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2025-01-09 04:43:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3966. [2025-01-09 04:43:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3964 states have (on average 1.3816851664984864) internal successors, (5477), 3965 states have internal predecessors, (5477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5477 transitions. [2025-01-09 04:43:00,571 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5477 transitions. Word has length 66 [2025-01-09 04:43:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:00,571 INFO L471 AbstractCegarLoop]: Abstraction has 3966 states and 5477 transitions. [2025-01-09 04:43:00,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-01-09 04:43:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5477 transitions. [2025-01-09 04:43:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:00,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:00,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:00,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:43:00,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 426192215, now seen corresponding path program 1 times [2025-01-09 04:43:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531582780] [2025-01-09 04:43:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:00,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531582780] [2025-01-09 04:43:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531582780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404196094] [2025-01-09 04:43:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:00,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:00,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:00,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:00,714 INFO L87 Difference]: Start difference. First operand 3966 states and 5477 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:01,271 INFO L93 Difference]: Finished difference Result 8216 states and 11566 transitions. [2025-01-09 04:43:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:43:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:01,291 INFO L225 Difference]: With dead ends: 8216 [2025-01-09 04:43:01,291 INFO L226 Difference]: Without dead ends: 7032 [2025-01-09 04:43:01,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:01,297 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 3121 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:01,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3121 Valid, 1019 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2025-01-09 04:43:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 3990. [2025-01-09 04:43:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3988 states have (on average 1.381394182547643) internal successors, (5509), 3989 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5509 transitions. [2025-01-09 04:43:01,420 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 5509 transitions. Word has length 67 [2025-01-09 04:43:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 3990 states and 5509 transitions. [2025-01-09 04:43:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 5509 transitions. [2025-01-09 04:43:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:43:01,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:01,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:01,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:43:01,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -889016011, now seen corresponding path program 1 times [2025-01-09 04:43:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577903360] [2025-01-09 04:43:01,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:01,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:43:01,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:43:01,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:01,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577903360] [2025-01-09 04:43:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577903360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533034105] [2025-01-09 04:43:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:01,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:01,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:01,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:01,576 INFO L87 Difference]: Start difference. First operand 3990 states and 5509 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:01,945 INFO L93 Difference]: Finished difference Result 9015 states and 12509 transitions. [2025-01-09 04:43:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:01,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:43:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:01,959 INFO L225 Difference]: With dead ends: 9015 [2025-01-09 04:43:01,962 INFO L226 Difference]: Without dead ends: 5335 [2025-01-09 04:43:01,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:01,968 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2348 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 530 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2025-01-09 04:43:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 3990. [2025-01-09 04:43:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3988 states have (on average 1.376629889669007) internal successors, (5490), 3989 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5490 transitions. [2025-01-09 04:43:02,107 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 5490 transitions. Word has length 67 [2025-01-09 04:43:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 3990 states and 5490 transitions. [2025-01-09 04:43:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 5490 transitions. [2025-01-09 04:43:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:02,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:02,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:43:02,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:02,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash -132013379, now seen corresponding path program 1 times [2025-01-09 04:43:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928009929] [2025-01-09 04:43:02,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:02,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:02,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:02,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:02,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928009929] [2025-01-09 04:43:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928009929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:02,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:02,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:43:02,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617462837] [2025-01-09 04:43:02,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:02,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:43:02,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:02,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:43:02,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:43:02,288 INFO L87 Difference]: Start difference. First operand 3990 states and 5490 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:02,624 INFO L93 Difference]: Finished difference Result 8904 states and 12251 transitions. [2025-01-09 04:43:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:43:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:02,636 INFO L225 Difference]: With dead ends: 8904 [2025-01-09 04:43:02,636 INFO L226 Difference]: Without dead ends: 5195 [2025-01-09 04:43:02,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:02,642 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 2066 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:02,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 487 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2025-01-09 04:43:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 5173. [2025-01-09 04:43:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5171 states have (on average 1.3612454070779347) internal successors, (7039), 5172 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7039 transitions. [2025-01-09 04:43:02,706 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7039 transitions. Word has length 68 [2025-01-09 04:43:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:02,707 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 7039 transitions. [2025-01-09 04:43:02,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7039 transitions. [2025-01-09 04:43:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:43:02,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:02,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:02,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:43:02,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:02,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -416949424, now seen corresponding path program 1 times [2025-01-09 04:43:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:02,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034118158] [2025-01-09 04:43:02,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:02,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:43:02,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:43:02,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:02,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034118158] [2025-01-09 04:43:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034118158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:02,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020338180] [2025-01-09 04:43:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:02,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:02,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:02,839 INFO L87 Difference]: Start difference. First operand 5173 states and 7039 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:03,322 INFO L93 Difference]: Finished difference Result 10854 states and 14878 transitions. [2025-01-09 04:43:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:43:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:03,334 INFO L225 Difference]: With dead ends: 10854 [2025-01-09 04:43:03,334 INFO L226 Difference]: Without dead ends: 8337 [2025-01-09 04:43:03,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:03,338 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 2676 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:03,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 934 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:43:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2025-01-09 04:43:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 5201. [2025-01-09 04:43:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5199 states have (on average 1.3608386228120792) internal successors, (7075), 5200 states have internal predecessors, (7075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 7075 transitions. [2025-01-09 04:43:03,416 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 7075 transitions. Word has length 68 [2025-01-09 04:43:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:03,416 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 7075 transitions. [2025-01-09 04:43:03,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 7075 transitions. [2025-01-09 04:43:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:43:03,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:03,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:03,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:43:03,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:03,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1441651372, now seen corresponding path program 1 times [2025-01-09 04:43:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230732882] [2025-01-09 04:43:03,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:03,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:43:03,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:43:03,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:03,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230732882] [2025-01-09 04:43:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230732882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987783626] [2025-01-09 04:43:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:03,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:03,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:03,534 INFO L87 Difference]: Start difference. First operand 5201 states and 7075 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:04,064 INFO L93 Difference]: Finished difference Result 13207 states and 18306 transitions. [2025-01-09 04:43:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:43:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:04,150 INFO L225 Difference]: With dead ends: 13207 [2025-01-09 04:43:04,150 INFO L226 Difference]: Without dead ends: 10971 [2025-01-09 04:43:04,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:04,154 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 2912 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:04,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2912 Valid, 998 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10971 states. [2025-01-09 04:43:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10971 to 5298. [2025-01-09 04:43:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5296 states have (on average 1.3602719033232629) internal successors, (7204), 5297 states have internal predecessors, (7204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7204 transitions. [2025-01-09 04:43:04,251 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7204 transitions. Word has length 69 [2025-01-09 04:43:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:04,251 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7204 transitions. [2025-01-09 04:43:04,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7204 transitions. [2025-01-09 04:43:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:43:04,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:04,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:04,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:43:04,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:04,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash 756148337, now seen corresponding path program 1 times [2025-01-09 04:43:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700634551] [2025-01-09 04:43:04,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:04,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:43:04,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:43:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:04,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700634551] [2025-01-09 04:43:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700634551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:43:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33942689] [2025-01-09 04:43:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:04,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:43:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:04,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:43:04,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:43:04,765 INFO L87 Difference]: Start difference. First operand 5298 states and 7204 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:05,853 INFO L93 Difference]: Finished difference Result 9349 states and 12788 transitions. [2025-01-09 04:43:05,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:43:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:05,868 INFO L225 Difference]: With dead ends: 9349 [2025-01-09 04:43:05,868 INFO L226 Difference]: Without dead ends: 7704 [2025-01-09 04:43:05,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:05,872 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 2629 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2629 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:05,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2629 Valid, 2081 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:43:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7704 states. [2025-01-09 04:43:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7704 to 5298. [2025-01-09 04:43:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5296 states have (on average 1.3598942598187311) internal successors, (7202), 5297 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7202 transitions. [2025-01-09 04:43:05,964 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7202 transitions. Word has length 70 [2025-01-09 04:43:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:05,965 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7202 transitions. [2025-01-09 04:43:05,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7202 transitions. [2025-01-09 04:43:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:43:05,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:05,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:43:05,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -223540144, now seen corresponding path program 1 times [2025-01-09 04:43:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788542657] [2025-01-09 04:43:05,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:05,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:43:06,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:43:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788542657] [2025-01-09 04:43:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788542657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865778372] [2025-01-09 04:43:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:06,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:06,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:06,248 INFO L87 Difference]: Start difference. First operand 5298 states and 7202 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:06,930 INFO L93 Difference]: Finished difference Result 10936 states and 15114 transitions. [2025-01-09 04:43:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:43:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:06,942 INFO L225 Difference]: With dead ends: 10936 [2025-01-09 04:43:06,943 INFO L226 Difference]: Without dead ends: 7848 [2025-01-09 04:43:06,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:06,948 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 3222 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:06,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 1634 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2025-01-09 04:43:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 5294. [2025-01-09 04:43:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 5292 states have (on average 1.3594104308390023) internal successors, (7194), 5293 states have internal predecessors, (7194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 7194 transitions. [2025-01-09 04:43:07,020 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 7194 transitions. Word has length 70 [2025-01-09 04:43:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 5294 states and 7194 transitions. [2025-01-09 04:43:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 7194 transitions. [2025-01-09 04:43:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:07,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:07,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:43:07,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:07,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 66854135, now seen corresponding path program 1 times [2025-01-09 04:43:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:07,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469656137] [2025-01-09 04:43:07,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:07,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:07,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469656137] [2025-01-09 04:43:07,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469656137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:43:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130655565] [2025-01-09 04:43:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:43:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:07,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:43:07,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:07,707 INFO L87 Difference]: Start difference. First operand 5294 states and 7194 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:08,905 INFO L93 Difference]: Finished difference Result 17329 states and 24091 transitions. [2025-01-09 04:43:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:43:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:43:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:08,932 INFO L225 Difference]: With dead ends: 17329 [2025-01-09 04:43:08,933 INFO L226 Difference]: Without dead ends: 14243 [2025-01-09 04:43:08,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:43:08,940 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 4230 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:08,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 3673 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:43:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14243 states. [2025-01-09 04:43:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14243 to 5288. [2025-01-09 04:43:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 5286 states have (on average 1.358683314415437) internal successors, (7182), 5287 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 7182 transitions. [2025-01-09 04:43:09,063 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 7182 transitions. Word has length 71 [2025-01-09 04:43:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 5288 states and 7182 transitions. [2025-01-09 04:43:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 7182 transitions. [2025-01-09 04:43:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:09,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:09,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:09,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:43:09,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1113625680, now seen corresponding path program 1 times [2025-01-09 04:43:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123699802] [2025-01-09 04:43:09,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:09,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:09,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:09,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:09,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123699802] [2025-01-09 04:43:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123699802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426358568] [2025-01-09 04:43:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:09,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:09,287 INFO L87 Difference]: Start difference. First operand 5288 states and 7182 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:09,960 INFO L93 Difference]: Finished difference Result 11030 states and 15251 transitions. [2025-01-09 04:43:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:43:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:09,970 INFO L225 Difference]: With dead ends: 11030 [2025-01-09 04:43:09,970 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 04:43:09,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:09,974 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 3259 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3259 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:09,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3259 Valid, 1566 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 04:43:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 5264. [2025-01-09 04:43:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5264 states, 5262 states have (on average 1.3574686431014824) internal successors, (7143), 5263 states have internal predecessors, (7143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 7143 transitions. [2025-01-09 04:43:10,095 INFO L78 Accepts]: Start accepts. Automaton has 5264 states and 7143 transitions. Word has length 71 [2025-01-09 04:43:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:10,095 INFO L471 AbstractCegarLoop]: Abstraction has 5264 states and 7143 transitions. [2025-01-09 04:43:10,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5264 states and 7143 transitions. [2025-01-09 04:43:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:10,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:10,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:43:10,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 468124592, now seen corresponding path program 1 times [2025-01-09 04:43:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119399255] [2025-01-09 04:43:10,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:10,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119399255] [2025-01-09 04:43:10,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119399255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:10,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:43:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910925536] [2025-01-09 04:43:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:43:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:10,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:43:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:10,792 INFO L87 Difference]: Start difference. First operand 5264 states and 7143 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:11,374 INFO L93 Difference]: Finished difference Result 12262 states and 16989 transitions. [2025-01-09 04:43:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:43:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:43:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:11,387 INFO L225 Difference]: With dead ends: 12262 [2025-01-09 04:43:11,387 INFO L226 Difference]: Without dead ends: 8976 [2025-01-09 04:43:11,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:43:11,392 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 2790 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2790 SdHoareTripleChecker+Valid, 3802 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:11,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2790 Valid, 3802 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8976 states. [2025-01-09 04:43:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8976 to 5054. [2025-01-09 04:43:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5054 states, 5052 states have (on average 1.3596595407759304) internal successors, (6869), 5053 states have internal predecessors, (6869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6869 transitions. [2025-01-09 04:43:11,497 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6869 transitions. Word has length 71 [2025-01-09 04:43:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:11,497 INFO L471 AbstractCegarLoop]: Abstraction has 5054 states and 6869 transitions. [2025-01-09 04:43:11,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6869 transitions. [2025-01-09 04:43:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:43:11,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:11,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:11,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:43:11,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash 525454090, now seen corresponding path program 1 times [2025-01-09 04:43:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582855438] [2025-01-09 04:43:11,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:11,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:43:11,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:43:11,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:11,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582855438] [2025-01-09 04:43:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582855438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322451126] [2025-01-09 04:43:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:43:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:11,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:43:11,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:43:11,601 INFO L87 Difference]: Start difference. First operand 5054 states and 6869 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:12,063 INFO L93 Difference]: Finished difference Result 11722 states and 16172 transitions. [2025-01-09 04:43:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:43:12,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 04:43:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:12,076 INFO L225 Difference]: With dead ends: 11722 [2025-01-09 04:43:12,076 INFO L226 Difference]: Without dead ends: 9650 [2025-01-09 04:43:12,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:12,080 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 2659 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:12,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 935 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:43:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2025-01-09 04:43:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 5125. [2025-01-09 04:43:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5123 states have (on average 1.3601405426507907) internal successors, (6968), 5124 states have internal predecessors, (6968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6968 transitions. [2025-01-09 04:43:12,160 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6968 transitions. Word has length 71 [2025-01-09 04:43:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:12,161 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 6968 transitions. [2025-01-09 04:43:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6968 transitions. [2025-01-09 04:43:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:43:12,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:12,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:43:12,165 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1951824160, now seen corresponding path program 1 times [2025-01-09 04:43:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290418867] [2025-01-09 04:43:12,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:12,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:43:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:43:12,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:12,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290418867] [2025-01-09 04:43:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290418867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:43:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162631465] [2025-01-09 04:43:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:12,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:43:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:12,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:43:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:12,623 INFO L87 Difference]: Start difference. First operand 5125 states and 6968 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:13,230 INFO L93 Difference]: Finished difference Result 12111 states and 16792 transitions. [2025-01-09 04:43:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:43:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:43:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:13,243 INFO L225 Difference]: With dead ends: 12111 [2025-01-09 04:43:13,243 INFO L226 Difference]: Without dead ends: 8944 [2025-01-09 04:43:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:43:13,249 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 3084 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3084 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:13,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3084 Valid, 3586 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8944 states. [2025-01-09 04:43:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8944 to 5038. [2025-01-09 04:43:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5038 states, 5037 states have (on average 1.3575540996624975) internal successors, (6838), 5037 states have internal predecessors, (6838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 6838 transitions. [2025-01-09 04:43:13,314 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 6838 transitions. Word has length 72 [2025-01-09 04:43:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:13,314 INFO L471 AbstractCegarLoop]: Abstraction has 5038 states and 6838 transitions. [2025-01-09 04:43:13,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 6838 transitions. [2025-01-09 04:43:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:43:13,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:13,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:43:13,318 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 216436712, now seen corresponding path program 1 times [2025-01-09 04:43:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626743812] [2025-01-09 04:43:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:13,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:43:13,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:43:13,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:13,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626743812] [2025-01-09 04:43:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626743812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:43:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454143344] [2025-01-09 04:43:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:43:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:13,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:43:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:43:13,500 INFO L87 Difference]: Start difference. First operand 5038 states and 6838 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:14,117 INFO L93 Difference]: Finished difference Result 12203 states and 16876 transitions. [2025-01-09 04:43:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:43:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:43:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:14,131 INFO L225 Difference]: With dead ends: 12203 [2025-01-09 04:43:14,131 INFO L226 Difference]: Without dead ends: 8873 [2025-01-09 04:43:14,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:14,136 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2092 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:14,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 1659 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2025-01-09 04:43:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 4913. [2025-01-09 04:43:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4912 states have (on average 1.3574918566775245) internal successors, (6668), 4912 states have internal predecessors, (6668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 6668 transitions. [2025-01-09 04:43:14,201 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 6668 transitions. Word has length 72 [2025-01-09 04:43:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:14,201 INFO L471 AbstractCegarLoop]: Abstraction has 4913 states and 6668 transitions. [2025-01-09 04:43:14,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 6668 transitions. [2025-01-09 04:43:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:43:14,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:14,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:14,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:43:14,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:14,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 701339809, now seen corresponding path program 1 times [2025-01-09 04:43:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:14,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181415999] [2025-01-09 04:43:14,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:43:14,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:43:14,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:14,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181415999] [2025-01-09 04:43:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181415999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:14,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:14,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:43:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737170109] [2025-01-09 04:43:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:43:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:43:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:14,681 INFO L87 Difference]: Start difference. First operand 4913 states and 6668 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:15,462 INFO L93 Difference]: Finished difference Result 10257 states and 14182 transitions. [2025-01-09 04:43:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:15,463 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:43:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:15,486 INFO L225 Difference]: With dead ends: 10257 [2025-01-09 04:43:15,486 INFO L226 Difference]: Without dead ends: 8169 [2025-01-09 04:43:15,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:43:15,495 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2406 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:15,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 2748 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:43:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2025-01-09 04:43:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 4913. [2025-01-09 04:43:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4912 states have (on average 1.357288273615635) internal successors, (6667), 4912 states have internal predecessors, (6667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 6667 transitions. [2025-01-09 04:43:15,691 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 6667 transitions. Word has length 73 [2025-01-09 04:43:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:15,691 INFO L471 AbstractCegarLoop]: Abstraction has 4913 states and 6667 transitions. [2025-01-09 04:43:15,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 6667 transitions. [2025-01-09 04:43:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:43:15,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:15,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:15,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:43:15,701 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:15,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -39253326, now seen corresponding path program 1 times [2025-01-09 04:43:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88576489] [2025-01-09 04:43:15,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:15,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:43:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:43:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88576489] [2025-01-09 04:43:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88576489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:15,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93244815] [2025-01-09 04:43:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:15,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:15,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:15,772 INFO L87 Difference]: Start difference. First operand 4913 states and 6667 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:15,821 INFO L93 Difference]: Finished difference Result 7318 states and 10015 transitions. [2025-01-09 04:43:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:43:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:15,829 INFO L225 Difference]: With dead ends: 7318 [2025-01-09 04:43:15,830 INFO L226 Difference]: Without dead ends: 4915 [2025-01-09 04:43:15,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:15,833 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 328 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:15,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1227 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2025-01-09 04:43:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4913. [2025-01-09 04:43:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 4912 states have (on average 1.346498371335505) internal successors, (6614), 4912 states have internal predecessors, (6614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 6614 transitions. [2025-01-09 04:43:15,888 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 6614 transitions. Word has length 74 [2025-01-09 04:43:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:15,888 INFO L471 AbstractCegarLoop]: Abstraction has 4913 states and 6614 transitions. [2025-01-09 04:43:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 6614 transitions. [2025-01-09 04:43:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:43:15,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:15,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:43:15,893 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash 753697715, now seen corresponding path program 1 times [2025-01-09 04:43:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572737315] [2025-01-09 04:43:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:43:15,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:43:15,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572737315] [2025-01-09 04:43:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572737315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413957418] [2025-01-09 04:43:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:15,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:15,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:15,932 INFO L87 Difference]: Start difference. First operand 4913 states and 6614 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:16,040 INFO L93 Difference]: Finished difference Result 9597 states and 13053 transitions. [2025-01-09 04:43:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:43:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:16,061 INFO L225 Difference]: With dead ends: 9597 [2025-01-09 04:43:16,061 INFO L226 Difference]: Without dead ends: 6810 [2025-01-09 04:43:16,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:16,072 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 435 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:16,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 578 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6810 states. [2025-01-09 04:43:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6810 to 6790. [2025-01-09 04:43:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6790 states, 6789 states have (on average 1.3641184268669908) internal successors, (9261), 6789 states have internal predecessors, (9261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 9261 transitions. [2025-01-09 04:43:16,130 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 9261 transitions. Word has length 74 [2025-01-09 04:43:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 6790 states and 9261 transitions. [2025-01-09 04:43:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 9261 transitions. [2025-01-09 04:43:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:43:16,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:16,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:16,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:43:16,135 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1200633410, now seen corresponding path program 1 times [2025-01-09 04:43:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288491782] [2025-01-09 04:43:16,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:16,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:43:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:43:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288491782] [2025-01-09 04:43:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288491782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:16,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699427451] [2025-01-09 04:43:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:16,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:16,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:16,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:16,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:16,173 INFO L87 Difference]: Start difference. First operand 6790 states and 9261 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:16,250 INFO L93 Difference]: Finished difference Result 14232 states and 19591 transitions. [2025-01-09 04:43:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 04:43:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:16,264 INFO L225 Difference]: With dead ends: 14232 [2025-01-09 04:43:16,264 INFO L226 Difference]: Without dead ends: 10165 [2025-01-09 04:43:16,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:16,271 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 371 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:16,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 550 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10165 states. [2025-01-09 04:43:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10165 to 10133. [2025-01-09 04:43:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10133 states, 10132 states have (on average 1.3788985392814843) internal successors, (13971), 10132 states have internal predecessors, (13971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10133 states to 10133 states and 13971 transitions. [2025-01-09 04:43:16,376 INFO L78 Accepts]: Start accepts. Automaton has 10133 states and 13971 transitions. Word has length 75 [2025-01-09 04:43:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 10133 states and 13971 transitions. [2025-01-09 04:43:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10133 states and 13971 transitions. [2025-01-09 04:43:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:43:16,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:16,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:16,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:43:16,382 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 173641677, now seen corresponding path program 1 times [2025-01-09 04:43:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835047470] [2025-01-09 04:43:16,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:16,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:43:16,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:43:16,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:16,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:16,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:16,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835047470] [2025-01-09 04:43:16,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835047470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:16,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610487201] [2025-01-09 04:43:16,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:16,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:16,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:16,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:16,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:16,422 INFO L87 Difference]: Start difference. First operand 10133 states and 13971 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:16,544 INFO L93 Difference]: Finished difference Result 19255 states and 26694 transitions. [2025-01-09 04:43:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:16,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 04:43:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:16,563 INFO L225 Difference]: With dead ends: 19255 [2025-01-09 04:43:16,563 INFO L226 Difference]: Without dead ends: 12800 [2025-01-09 04:43:16,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:16,570 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 369 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:16,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 645 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12800 states. [2025-01-09 04:43:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12800 to 9461. [2025-01-09 04:43:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9461 states, 9460 states have (on average 1.3839323467230444) internal successors, (13092), 9460 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 13092 transitions. [2025-01-09 04:43:16,666 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 13092 transitions. Word has length 75 [2025-01-09 04:43:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 9461 states and 13092 transitions. [2025-01-09 04:43:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 13092 transitions. [2025-01-09 04:43:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:43:16,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:16,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:16,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:43:16,671 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -859725899, now seen corresponding path program 1 times [2025-01-09 04:43:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671198873] [2025-01-09 04:43:16,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:16,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:43:16,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:43:16,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:16,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:16,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671198873] [2025-01-09 04:43:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671198873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:43:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517862261] [2025-01-09 04:43:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:16,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:43:16,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:16,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:43:16,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:16,999 INFO L87 Difference]: Start difference. First operand 9461 states and 13092 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:18,005 INFO L93 Difference]: Finished difference Result 36785 states and 51099 transitions. [2025-01-09 04:43:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:43:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:43:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:18,049 INFO L225 Difference]: With dead ends: 36785 [2025-01-09 04:43:18,049 INFO L226 Difference]: Without dead ends: 33927 [2025-01-09 04:43:18,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:43:18,065 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 5088 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:18,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 1484 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:43:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33927 states. [2025-01-09 04:43:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33927 to 9469. [2025-01-09 04:43:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9469 states, 9468 states have (on average 1.3836079425433037) internal successors, (13100), 9468 states have internal predecessors, (13100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9469 states to 9469 states and 13100 transitions. [2025-01-09 04:43:18,367 INFO L78 Accepts]: Start accepts. Automaton has 9469 states and 13100 transitions. Word has length 76 [2025-01-09 04:43:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 9469 states and 13100 transitions. [2025-01-09 04:43:18,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9469 states and 13100 transitions. [2025-01-09 04:43:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:43:18,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:18,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:18,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:43:18,371 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 812559439, now seen corresponding path program 1 times [2025-01-09 04:43:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:18,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620626785] [2025-01-09 04:43:18,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:43:18,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:43:18,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:18,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620626785] [2025-01-09 04:43:18,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620626785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:18,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:18,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:18,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030352897] [2025-01-09 04:43:18,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:18,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:18,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:18,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:18,543 INFO L87 Difference]: Start difference. First operand 9469 states and 13100 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:19,006 INFO L93 Difference]: Finished difference Result 12499 states and 17303 transitions. [2025-01-09 04:43:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:43:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:43:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:19,015 INFO L225 Difference]: With dead ends: 12499 [2025-01-09 04:43:19,015 INFO L226 Difference]: Without dead ends: 9675 [2025-01-09 04:43:19,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:19,019 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 2157 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:19,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 1114 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9675 states. [2025-01-09 04:43:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9675 to 9469. [2025-01-09 04:43:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9469 states, 9468 states have (on average 1.3835023236163921) internal successors, (13099), 9468 states have internal predecessors, (13099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9469 states to 9469 states and 13099 transitions. [2025-01-09 04:43:19,105 INFO L78 Accepts]: Start accepts. Automaton has 9469 states and 13099 transitions. Word has length 76 [2025-01-09 04:43:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:19,105 INFO L471 AbstractCegarLoop]: Abstraction has 9469 states and 13099 transitions. [2025-01-09 04:43:19,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9469 states and 13099 transitions. [2025-01-09 04:43:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:43:19,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:43:19,109 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 108461126, now seen corresponding path program 1 times [2025-01-09 04:43:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177893279] [2025-01-09 04:43:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:19,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:43:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:43:19,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177893279] [2025-01-09 04:43:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177893279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:19,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:19,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:43:19,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770770169] [2025-01-09 04:43:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:19,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:19,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:19,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:19,316 INFO L87 Difference]: Start difference. First operand 9469 states and 13099 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:19,811 INFO L93 Difference]: Finished difference Result 15828 states and 21898 transitions. [2025-01-09 04:43:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:43:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:43:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:19,823 INFO L225 Difference]: With dead ends: 15828 [2025-01-09 04:43:19,823 INFO L226 Difference]: Without dead ends: 12970 [2025-01-09 04:43:19,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:43:19,830 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 2149 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:19,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 1197 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:43:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2025-01-09 04:43:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 9446. [2025-01-09 04:43:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9446 states, 9445 states have (on average 1.384012705134992) internal successors, (13072), 9445 states have internal predecessors, (13072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9446 states to 9446 states and 13072 transitions. [2025-01-09 04:43:19,933 INFO L78 Accepts]: Start accepts. Automaton has 9446 states and 13072 transitions. Word has length 77 [2025-01-09 04:43:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:19,933 INFO L471 AbstractCegarLoop]: Abstraction has 9446 states and 13072 transitions. [2025-01-09 04:43:19,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9446 states and 13072 transitions. [2025-01-09 04:43:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:43:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:19,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:43:19,937 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1768326172, now seen corresponding path program 1 times [2025-01-09 04:43:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591103145] [2025-01-09 04:43:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:19,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:43:19,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:43:19,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591103145] [2025-01-09 04:43:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591103145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523524331] [2025-01-09 04:43:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:19,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:19,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:19,982 INFO L87 Difference]: Start difference. First operand 9446 states and 13072 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:20,035 INFO L93 Difference]: Finished difference Result 12680 states and 17564 transitions. [2025-01-09 04:43:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:43:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:20,043 INFO L225 Difference]: With dead ends: 12680 [2025-01-09 04:43:20,043 INFO L226 Difference]: Without dead ends: 7810 [2025-01-09 04:43:20,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:20,048 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 245 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:20,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 805 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2025-01-09 04:43:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 6004. [2025-01-09 04:43:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6004 states, 6003 states have (on average 1.3594869232050641) internal successors, (8161), 6003 states have internal predecessors, (8161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6004 states to 6004 states and 8161 transitions. [2025-01-09 04:43:20,111 INFO L78 Accepts]: Start accepts. Automaton has 6004 states and 8161 transitions. Word has length 77 [2025-01-09 04:43:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:20,111 INFO L471 AbstractCegarLoop]: Abstraction has 6004 states and 8161 transitions. [2025-01-09 04:43:20,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 6004 states and 8161 transitions. [2025-01-09 04:43:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:43:20,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:20,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:20,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:43:20,116 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1645706330, now seen corresponding path program 1 times [2025-01-09 04:43:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852143241] [2025-01-09 04:43:20,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:43:20,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:43:20,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:20,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852143241] [2025-01-09 04:43:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852143241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:20,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049162691] [2025-01-09 04:43:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:20,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:20,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:20,159 INFO L87 Difference]: Start difference. First operand 6004 states and 8161 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:20,189 INFO L93 Difference]: Finished difference Result 8035 states and 10934 transitions. [2025-01-09 04:43:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:43:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:20,194 INFO L225 Difference]: With dead ends: 8035 [2025-01-09 04:43:20,194 INFO L226 Difference]: Without dead ends: 5039 [2025-01-09 04:43:20,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:20,196 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 252 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:20,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 848 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2025-01-09 04:43:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 3972. [2025-01-09 04:43:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3971 states have (on average 1.3281289347771341) internal successors, (5274), 3971 states have internal predecessors, (5274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5274 transitions. [2025-01-09 04:43:20,222 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5274 transitions. Word has length 77 [2025-01-09 04:43:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:20,223 INFO L471 AbstractCegarLoop]: Abstraction has 3972 states and 5274 transitions. [2025-01-09 04:43:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5274 transitions. [2025-01-09 04:43:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:43:20,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:20,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:43:20,226 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 264768951, now seen corresponding path program 1 times [2025-01-09 04:43:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103731050] [2025-01-09 04:43:20,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:20,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:43:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:43:20,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103731050] [2025-01-09 04:43:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103731050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 04:43:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055960264] [2025-01-09 04:43:21,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 04:43:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:21,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 04:43:21,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:43:21,302 INFO L87 Difference]: Start difference. First operand 3972 states and 5274 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:23,988 INFO L93 Difference]: Finished difference Result 11411 states and 15348 transitions. [2025-01-09 04:43:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 04:43:23,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:43:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:23,999 INFO L225 Difference]: With dead ends: 11411 [2025-01-09 04:43:24,000 INFO L226 Difference]: Without dead ends: 11286 [2025-01-09 04:43:24,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:43:24,004 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 3263 mSDsluCounter, 6311 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3263 SdHoareTripleChecker+Valid, 6670 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:24,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3263 Valid, 6670 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3311 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:43:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11286 states. [2025-01-09 04:43:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11286 to 3984. [2025-01-09 04:43:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3983 states have (on average 1.3276424805423048) internal successors, (5288), 3983 states have internal predecessors, (5288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5288 transitions. [2025-01-09 04:43:24,059 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5288 transitions. Word has length 79 [2025-01-09 04:43:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 3984 states and 5288 transitions. [2025-01-09 04:43:24,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5288 transitions. [2025-01-09 04:43:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:43:24,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:24,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:24,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:43:24,067 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:24,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1223763033, now seen corresponding path program 1 times [2025-01-09 04:43:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910460069] [2025-01-09 04:43:24,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:43:24,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:43:24,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910460069] [2025-01-09 04:43:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910460069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:43:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044048773] [2025-01-09 04:43:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:24,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:43:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:24,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:43:24,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:43:24,542 INFO L87 Difference]: Start difference. First operand 3984 states and 5288 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:25,180 INFO L93 Difference]: Finished difference Result 11530 states and 15519 transitions. [2025-01-09 04:43:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:43:25,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:43:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:25,190 INFO L225 Difference]: With dead ends: 11530 [2025-01-09 04:43:25,190 INFO L226 Difference]: Without dead ends: 11363 [2025-01-09 04:43:25,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:43:25,195 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 3749 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3749 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:25,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3749 Valid, 2017 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:43:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11363 states. [2025-01-09 04:43:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11363 to 3939. [2025-01-09 04:43:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3938 states have (on average 1.3285931945149823) internal successors, (5232), 3938 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5232 transitions. [2025-01-09 04:43:25,278 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5232 transitions. Word has length 79 [2025-01-09 04:43:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5232 transitions. [2025-01-09 04:43:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5232 transitions. [2025-01-09 04:43:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 04:43:25,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:25,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:43:25,286 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash 974682057, now seen corresponding path program 1 times [2025-01-09 04:43:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451695042] [2025-01-09 04:43:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:25,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 04:43:25,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 04:43:25,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:25,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451695042] [2025-01-09 04:43:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451695042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:25,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677159184] [2025-01-09 04:43:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:25,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:25,460 INFO L87 Difference]: Start difference. First operand 3939 states and 5232 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:25,653 INFO L93 Difference]: Finished difference Result 12661 states and 17324 transitions. [2025-01-09 04:43:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:25,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-01-09 04:43:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:25,695 INFO L225 Difference]: With dead ends: 12661 [2025-01-09 04:43:25,696 INFO L226 Difference]: Without dead ends: 9797 [2025-01-09 04:43:25,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:25,698 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1742 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:25,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1189 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9797 states. [2025-01-09 04:43:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9797 to 6801. [2025-01-09 04:43:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6801 states, 6800 states have (on average 1.3372058823529411) internal successors, (9093), 6800 states have internal predecessors, (9093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 9093 transitions. [2025-01-09 04:43:25,768 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 9093 transitions. Word has length 85 [2025-01-09 04:43:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 6801 states and 9093 transitions. [2025-01-09 04:43:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 9093 transitions. [2025-01-09 04:43:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 04:43:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:25,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:43:25,776 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -567265296, now seen corresponding path program 1 times [2025-01-09 04:43:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242608594] [2025-01-09 04:43:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 04:43:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 04:43:25,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:25,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:25,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:25,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242608594] [2025-01-09 04:43:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242608594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:25,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:25,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:25,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141221726] [2025-01-09 04:43:25,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:25,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:25,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:25,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:25,887 INFO L87 Difference]: Start difference. First operand 6801 states and 9093 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:26,012 INFO L93 Difference]: Finished difference Result 8905 states and 11872 transitions. [2025-01-09 04:43:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:26,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 04:43:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:26,022 INFO L225 Difference]: With dead ends: 8905 [2025-01-09 04:43:26,022 INFO L226 Difference]: Without dead ends: 8065 [2025-01-09 04:43:26,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:26,026 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 900 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:26,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1180 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8065 states. [2025-01-09 04:43:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8065 to 7683. [2025-01-09 04:43:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7682 states have (on average 1.3366310856547774) internal successors, (10268), 7682 states have internal predecessors, (10268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 10268 transitions. [2025-01-09 04:43:26,125 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 10268 transitions. Word has length 86 [2025-01-09 04:43:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:26,125 INFO L471 AbstractCegarLoop]: Abstraction has 7683 states and 10268 transitions. [2025-01-09 04:43:26,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 10268 transitions. [2025-01-09 04:43:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:43:26,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:26,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:26,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:43:26,131 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:26,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:26,131 INFO L85 PathProgramCache]: Analyzing trace with hash -238941005, now seen corresponding path program 1 times [2025-01-09 04:43:26,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:26,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399789352] [2025-01-09 04:43:26,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:26,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:43:26,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:43:26,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:26,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399789352] [2025-01-09 04:43:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399789352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514193039] [2025-01-09 04:43:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:26,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:26,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:26,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:26,197 INFO L87 Difference]: Start difference. First operand 7683 states and 10268 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:26,246 INFO L93 Difference]: Finished difference Result 20423 states and 27516 transitions. [2025-01-09 04:43:26,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:26,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:43:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:26,260 INFO L225 Difference]: With dead ends: 20423 [2025-01-09 04:43:26,260 INFO L226 Difference]: Without dead ends: 13801 [2025-01-09 04:43:26,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:26,269 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 171 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:26,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 785 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-01-09 04:43:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13319. [2025-01-09 04:43:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13319 states, 13318 states have (on average 1.3344345997897582) internal successors, (17772), 13318 states have internal predecessors, (17772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 17772 transitions. [2025-01-09 04:43:26,496 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 17772 transitions. Word has length 87 [2025-01-09 04:43:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 13319 states and 17772 transitions. [2025-01-09 04:43:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 17772 transitions. [2025-01-09 04:43:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:43:26,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:26,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:26,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:43:26,501 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -951231946, now seen corresponding path program 1 times [2025-01-09 04:43:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265666898] [2025-01-09 04:43:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:26,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:43:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:43:26,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:26,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:26,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265666898] [2025-01-09 04:43:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265666898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:26,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:26,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756043295] [2025-01-09 04:43:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:26,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:26,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:26,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:26,574 INFO L87 Difference]: Start difference. First operand 13319 states and 17772 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:26,724 INFO L93 Difference]: Finished difference Result 35939 states and 48170 transitions. [2025-01-09 04:43:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-09 04:43:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:26,744 INFO L225 Difference]: With dead ends: 35939 [2025-01-09 04:43:26,745 INFO L226 Difference]: Without dead ends: 23681 [2025-01-09 04:43:26,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:26,751 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 152 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:26,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 780 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23681 states. [2025-01-09 04:43:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23681 to 21551. [2025-01-09 04:43:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21551 states, 21550 states have (on average 1.3316937354988398) internal successors, (28698), 21550 states have internal predecessors, (28698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21551 states to 21551 states and 28698 transitions. [2025-01-09 04:43:27,040 INFO L78 Accepts]: Start accepts. Automaton has 21551 states and 28698 transitions. Word has length 87 [2025-01-09 04:43:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:27,042 INFO L471 AbstractCegarLoop]: Abstraction has 21551 states and 28698 transitions. [2025-01-09 04:43:27,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21551 states and 28698 transitions. [2025-01-09 04:43:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 04:43:27,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:27,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:43:27,047 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:27,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1516240729, now seen corresponding path program 1 times [2025-01-09 04:43:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847459113] [2025-01-09 04:43:27,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:27,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 04:43:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 04:43:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:27,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847459113] [2025-01-09 04:43:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847459113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:27,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:27,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571958188] [2025-01-09 04:43:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:27,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:27,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:27,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:27,163 INFO L87 Difference]: Start difference. First operand 21551 states and 28698 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:27,332 INFO L93 Difference]: Finished difference Result 60035 states and 79988 transitions. [2025-01-09 04:43:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-01-09 04:43:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:27,371 INFO L225 Difference]: With dead ends: 60035 [2025-01-09 04:43:27,371 INFO L226 Difference]: Without dead ends: 39545 [2025-01-09 04:43:27,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:27,392 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 134 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:27,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 771 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39545 states. [2025-01-09 04:43:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39545 to 35611. [2025-01-09 04:43:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35611 states, 35610 states have (on average 1.3235046335299074) internal successors, (47130), 35610 states have internal predecessors, (47130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35611 states to 35611 states and 47130 transitions. [2025-01-09 04:43:27,861 INFO L78 Accepts]: Start accepts. Automaton has 35611 states and 47130 transitions. Word has length 88 [2025-01-09 04:43:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:27,861 INFO L471 AbstractCegarLoop]: Abstraction has 35611 states and 47130 transitions. [2025-01-09 04:43:27,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 35611 states and 47130 transitions. [2025-01-09 04:43:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 04:43:27,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:27,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:27,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:43:27,865 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1059802897, now seen corresponding path program 1 times [2025-01-09 04:43:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485057876] [2025-01-09 04:43:27,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:27,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 04:43:27,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 04:43:27,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:27,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:27,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485057876] [2025-01-09 04:43:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485057876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652981734] [2025-01-09 04:43:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:27,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:27,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:27,929 INFO L87 Difference]: Start difference. First operand 35611 states and 47130 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:28,222 INFO L93 Difference]: Finished difference Result 101043 states and 133608 transitions. [2025-01-09 04:43:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:28,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 04:43:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:28,393 INFO L225 Difference]: With dead ends: 101043 [2025-01-09 04:43:28,393 INFO L226 Difference]: Without dead ends: 65158 [2025-01-09 04:43:28,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:28,422 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 102 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:28,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 766 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65158 states. [2025-01-09 04:43:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65158 to 59609. [2025-01-09 04:43:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59609 states, 59608 states have (on average 1.3106462219836263) internal successors, (78125), 59608 states have internal predecessors, (78125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59609 states to 59609 states and 78125 transitions. [2025-01-09 04:43:29,181 INFO L78 Accepts]: Start accepts. Automaton has 59609 states and 78125 transitions. Word has length 91 [2025-01-09 04:43:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:29,182 INFO L471 AbstractCegarLoop]: Abstraction has 59609 states and 78125 transitions. [2025-01-09 04:43:29,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 59609 states and 78125 transitions. [2025-01-09 04:43:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:43:29,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:29,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:43:29,185 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:29,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1224297681, now seen corresponding path program 1 times [2025-01-09 04:43:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760785301] [2025-01-09 04:43:29,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:43:29,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:43:29,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:29,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:29,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760785301] [2025-01-09 04:43:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760785301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:29,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038601246] [2025-01-09 04:43:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:29,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:29,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:29,416 INFO L87 Difference]: Start difference. First operand 59609 states and 78125 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:29,796 INFO L93 Difference]: Finished difference Result 64318 states and 84401 transitions. [2025-01-09 04:43:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:43:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:29,856 INFO L225 Difference]: With dead ends: 64318 [2025-01-09 04:43:29,856 INFO L226 Difference]: Without dead ends: 64313 [2025-01-09 04:43:29,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:29,863 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 0 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:29,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1900 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64313 states. [2025-01-09 04:43:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64313 to 64311. [2025-01-09 04:43:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64311 states, 64310 states have (on average 1.2878867983206344) internal successors, (82824), 64310 states have internal predecessors, (82824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64311 states to 64311 states and 82824 transitions. [2025-01-09 04:43:30,567 INFO L78 Accepts]: Start accepts. Automaton has 64311 states and 82824 transitions. Word has length 92 [2025-01-09 04:43:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:30,567 INFO L471 AbstractCegarLoop]: Abstraction has 64311 states and 82824 transitions. [2025-01-09 04:43:30,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 64311 states and 82824 transitions. [2025-01-09 04:43:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:43:30,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:30,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:30,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:43:30,571 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1147476022, now seen corresponding path program 1 times [2025-01-09 04:43:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153302443] [2025-01-09 04:43:30,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:30,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:43:30,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:43:30,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:30,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:30,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:30,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153302443] [2025-01-09 04:43:30,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153302443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:30,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:30,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577962453] [2025-01-09 04:43:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:30,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:30,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:30,614 INFO L87 Difference]: Start difference. First operand 64311 states and 82824 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:31,091 INFO L93 Difference]: Finished difference Result 160552 states and 205585 transitions. [2025-01-09 04:43:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:31,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:43:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:31,212 INFO L225 Difference]: With dead ends: 160552 [2025-01-09 04:43:31,212 INFO L226 Difference]: Without dead ends: 97109 [2025-01-09 04:43:31,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:31,260 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 264 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:31,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 597 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97109 states. [2025-01-09 04:43:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97109 to 96872. [2025-01-09 04:43:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96872 states, 96871 states have (on average 1.2663129316307253) internal successors, (122669), 96871 states have internal predecessors, (122669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96872 states to 96872 states and 122669 transitions. [2025-01-09 04:43:32,707 INFO L78 Accepts]: Start accepts. Automaton has 96872 states and 122669 transitions. Word has length 93 [2025-01-09 04:43:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:32,707 INFO L471 AbstractCegarLoop]: Abstraction has 96872 states and 122669 transitions. [2025-01-09 04:43:32,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 96872 states and 122669 transitions. [2025-01-09 04:43:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:43:32,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:32,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:32,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:43:32,713 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:32,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash -414323174, now seen corresponding path program 1 times [2025-01-09 04:43:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711352436] [2025-01-09 04:43:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:43:32,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:43:32,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:32,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711352436] [2025-01-09 04:43:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711352436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3010021] [2025-01-09 04:43:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:32,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:32,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:32,822 INFO L87 Difference]: Start difference. First operand 96872 states and 122669 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:33,311 INFO L93 Difference]: Finished difference Result 169319 states and 215703 transitions. [2025-01-09 04:43:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 04:43:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:33,511 INFO L225 Difference]: With dead ends: 169319 [2025-01-09 04:43:33,512 INFO L226 Difference]: Without dead ends: 151101 [2025-01-09 04:43:33,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:33,556 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 1361 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:33,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1335 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151101 states. [2025-01-09 04:43:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151101 to 114656. [2025-01-09 04:43:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114656 states, 114655 states have (on average 1.2651955867602809) internal successors, (145061), 114655 states have internal predecessors, (145061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114656 states to 114656 states and 145061 transitions. [2025-01-09 04:43:35,314 INFO L78 Accepts]: Start accepts. Automaton has 114656 states and 145061 transitions. Word has length 96 [2025-01-09 04:43:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:35,315 INFO L471 AbstractCegarLoop]: Abstraction has 114656 states and 145061 transitions. [2025-01-09 04:43:35,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 114656 states and 145061 transitions. [2025-01-09 04:43:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:43:35,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:35,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:35,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:43:35,318 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:35,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:35,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1871667339, now seen corresponding path program 1 times [2025-01-09 04:43:35,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:35,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146396273] [2025-01-09 04:43:35,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:43:35,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:43:35,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:35,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146396273] [2025-01-09 04:43:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146396273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:35,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277356537] [2025-01-09 04:43:35,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:35,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:35,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:35,404 INFO L87 Difference]: Start difference. First operand 114656 states and 145061 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:35,935 INFO L93 Difference]: Finished difference Result 175127 states and 222735 transitions. [2025-01-09 04:43:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:35,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:43:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:36,149 INFO L225 Difference]: With dead ends: 175127 [2025-01-09 04:43:36,150 INFO L226 Difference]: Without dead ends: 156909 [2025-01-09 04:43:36,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:36,444 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 1377 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:36,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1309 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156909 states. [2025-01-09 04:43:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156909 to 132440. [2025-01-09 04:43:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132440 states, 132439 states have (on average 1.2643783175650678) internal successors, (167453), 132439 states have internal predecessors, (167453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132440 states to 132440 states and 167453 transitions. [2025-01-09 04:43:38,208 INFO L78 Accepts]: Start accepts. Automaton has 132440 states and 167453 transitions. Word has length 97 [2025-01-09 04:43:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:38,208 INFO L471 AbstractCegarLoop]: Abstraction has 132440 states and 167453 transitions. [2025-01-09 04:43:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 132440 states and 167453 transitions. [2025-01-09 04:43:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:43:38,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:38,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:43:38,212 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1221418981, now seen corresponding path program 1 times [2025-01-09 04:43:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:38,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962212128] [2025-01-09 04:43:38,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:43:38,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:43:38,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:38,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962212128] [2025-01-09 04:43:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962212128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:43:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784149738] [2025-01-09 04:43:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:38,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:43:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:38,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:43:38,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:38,253 INFO L87 Difference]: Start difference. First operand 132440 states and 167453 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:38,685 INFO L93 Difference]: Finished difference Result 177417 states and 223400 transitions. [2025-01-09 04:43:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:43:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-09 04:43:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:39,157 INFO L225 Difference]: With dead ends: 177417 [2025-01-09 04:43:39,158 INFO L226 Difference]: Without dead ends: 117534 [2025-01-09 04:43:39,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:43:39,208 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 242 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:39,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 807 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:43:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117534 states. [2025-01-09 04:43:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117534 to 117532. [2025-01-09 04:43:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117532 states, 117531 states have (on average 1.2517293309850168) internal successors, (147117), 117531 states have internal predecessors, (147117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117532 states to 117532 states and 147117 transitions. [2025-01-09 04:43:40,554 INFO L78 Accepts]: Start accepts. Automaton has 117532 states and 147117 transitions. Word has length 100 [2025-01-09 04:43:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:40,554 INFO L471 AbstractCegarLoop]: Abstraction has 117532 states and 147117 transitions. [2025-01-09 04:43:40,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 117532 states and 147117 transitions. [2025-01-09 04:43:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:43:40,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:40,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:43:40,559 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 460468827, now seen corresponding path program 1 times [2025-01-09 04:43:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315053033] [2025-01-09 04:43:40,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:40,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:43:40,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:43:40,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:40,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:40,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:40,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315053033] [2025-01-09 04:43:40,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315053033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:40,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:43:40,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:43:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817396572] [2025-01-09 04:43:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:40,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:43:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:40,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:43:40,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:43:40,890 INFO L87 Difference]: Start difference. First operand 117532 states and 147117 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:41,425 INFO L93 Difference]: Finished difference Result 173974 states and 219066 transitions. [2025-01-09 04:43:41,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:43:41,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:43:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:41,605 INFO L225 Difference]: With dead ends: 173974 [2025-01-09 04:43:41,605 INFO L226 Difference]: Without dead ends: 146324 [2025-01-09 04:43:41,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:43:41,665 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1388 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:41,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 1278 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:43:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146324 states. [2025-01-09 04:43:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146324 to 136676. [2025-01-09 04:43:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136676 states, 136675 states have (on average 1.2501262118163528) internal successors, (170861), 136675 states have internal predecessors, (170861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136676 states to 136676 states and 170861 transitions. [2025-01-09 04:43:43,686 INFO L78 Accepts]: Start accepts. Automaton has 136676 states and 170861 transitions. Word has length 103 [2025-01-09 04:43:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:43,687 INFO L471 AbstractCegarLoop]: Abstraction has 136676 states and 170861 transitions. [2025-01-09 04:43:43,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 136676 states and 170861 transitions. [2025-01-09 04:43:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:43:43,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:43,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:43,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 04:43:43,701 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1394722692, now seen corresponding path program 1 times [2025-01-09 04:43:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908171042] [2025-01-09 04:43:43,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:43:43,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:43:43,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:43,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:43:43,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908171042] [2025-01-09 04:43:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908171042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:43:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295224001] [2025-01-09 04:43:43,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:43,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:43:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:43:43,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:43:43,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:43:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:43:44,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:43:44,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:44,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:44,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:43:44,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:43:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:43:44,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:43:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295224001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:43:44,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:43:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2025-01-09 04:43:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052406629] [2025-01-09 04:43:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:43:44,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:43:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:44,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:43:44,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:43:44,345 INFO L87 Difference]: Start difference. First operand 136676 states and 170861 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:45,842 INFO L93 Difference]: Finished difference Result 367933 states and 459683 transitions. [2025-01-09 04:43:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:43:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 04:43:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:46,267 INFO L225 Difference]: With dead ends: 367933 [2025-01-09 04:43:46,267 INFO L226 Difference]: Without dead ends: 311247 [2025-01-09 04:43:46,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:43:46,374 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1484 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:46,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1276 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:43:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311247 states. [2025-01-09 04:43:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311247 to 136624. [2025-01-09 04:43:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136624 states, 136623 states have (on average 1.250104301618322) internal successors, (170793), 136623 states have internal predecessors, (170793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136624 states to 136624 states and 170793 transitions. [2025-01-09 04:43:49,433 INFO L78 Accepts]: Start accepts. Automaton has 136624 states and 170793 transitions. Word has length 119 [2025-01-09 04:43:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:43:49,433 INFO L471 AbstractCegarLoop]: Abstraction has 136624 states and 170793 transitions. [2025-01-09 04:43:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 136624 states and 170793 transitions. [2025-01-09 04:43:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 04:43:49,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:43:49,445 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:43:49,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:43:49,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-01-09 04:43:49,646 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:43:49,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:43:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1445248459, now seen corresponding path program 1 times [2025-01-09 04:43:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:43:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610805159] [2025-01-09 04:43:49,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:49,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:43:49,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:43:49,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:43:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:43:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:43:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610805159] [2025-01-09 04:43:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610805159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:43:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924840194] [2025-01-09 04:43:49,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:43:49,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:43:49,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:43:49,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:43:49,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:43:49,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 04:43:50,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 04:43:50,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:43:50,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:43:50,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:43:50,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:43:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:50,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:43:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:43:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924840194] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:43:51,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:43:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 21 [2025-01-09 04:43:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810535926] [2025-01-09 04:43:51,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:43:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:43:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:43:51,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:43:51,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:43:51,670 INFO L87 Difference]: Start difference. First operand 136624 states and 170793 transitions. Second operand has 21 states, 21 states have (on average 16.142857142857142) internal successors, (339), 21 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:43:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:43:56,359 INFO L93 Difference]: Finished difference Result 645440 states and 806488 transitions. [2025-01-09 04:43:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-01-09 04:43:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 16.142857142857142) internal successors, (339), 21 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 04:43:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:43:57,219 INFO L225 Difference]: With dead ends: 645440 [2025-01-09 04:43:57,220 INFO L226 Difference]: Without dead ends: 509750 [2025-01-09 04:43:57,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1240, Invalid=4766, Unknown=0, NotChecked=0, Total=6006 [2025-01-09 04:43:57,388 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 3897 mSDsluCounter, 2849 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3897 SdHoareTripleChecker+Valid, 3211 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:43:57,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3897 Valid, 3211 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:43:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509750 states. [2025-01-09 04:44:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509750 to 337474. [2025-01-09 04:44:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337474 states, 337473 states have (on average 1.254444059228442) internal successors, (423341), 337473 states have internal predecessors, (423341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337474 states to 337474 states and 423341 transitions. [2025-01-09 04:44:03,754 INFO L78 Accepts]: Start accepts. Automaton has 337474 states and 423341 transitions. Word has length 119 [2025-01-09 04:44:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:44:03,754 INFO L471 AbstractCegarLoop]: Abstraction has 337474 states and 423341 transitions. [2025-01-09 04:44:03,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 16.142857142857142) internal successors, (339), 21 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 337474 states and 423341 transitions. [2025-01-09 04:44:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:44:03,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:44:03,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:44:03,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:44:03,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:03,979 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:44:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:44:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash -498180937, now seen corresponding path program 1 times [2025-01-09 04:44:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:44:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685246359] [2025-01-09 04:44:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:44:04,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:44:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685246359] [2025-01-09 04:44:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685246359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:44:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147417791] [2025-01-09 04:44:04,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:44:04,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:44:04,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:44:04,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:44:04,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:44:04,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:44:04,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:44:04,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:44:04,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:44:04,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:44:04,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:44:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:04,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:44:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:44:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147417791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:44:04,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:44:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:44:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908095399] [2025-01-09 04:44:04,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:44:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:44:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:44:04,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:44:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:44:04,795 INFO L87 Difference]: Start difference. First operand 337474 states and 423341 transitions. Second operand has 14 states, 14 states have (on average 22.928571428571427) internal successors, (321), 14 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:44:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:44:07,800 INFO L93 Difference]: Finished difference Result 695658 states and 873250 transitions. [2025-01-09 04:44:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:44:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 22.928571428571427) internal successors, (321), 14 states have internal predecessors, (321), 0 states have call successors, (0), 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 121 [2025-01-09 04:44:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:44:08,340 INFO L225 Difference]: With dead ends: 695658 [2025-01-09 04:44:08,340 INFO L226 Difference]: Without dead ends: 359420 [2025-01-09 04:44:08,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:44:08,399 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 3626 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:44:08,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 1456 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:44:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359420 states.