./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/uthash-2.0.2/uthash_SAX_test10-3.i -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 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:48:30,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:48:30,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:48:30,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:48:30,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:48:30,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:48:30,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:48:30,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:48:30,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:48:30,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:48:30,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:48:30,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:48:30,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:48:30,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:48:30,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:48:30,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:48:30,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:48:30,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:48:30,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:48:30,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:48:30,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:48:30,382 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 -> 241cbbc1863278905c5862751ae4b8363464962676a0cc42dc0ceaf22f2782d4 [2025-02-06 08:48:30,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:48:30,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:48:30,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:48:30,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:48:30,796 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:48:30,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i [2025-02-06 08:48:32,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/126a9f209/20412911c2d546918e539c4a6c360a65/FLAG3feae9721 [2025-02-06 08:48:32,620 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:48:32,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-3.i [2025-02-06 08:48:32,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/126a9f209/20412911c2d546918e539c4a6c360a65/FLAG3feae9721 [2025-02-06 08:48:32,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/126a9f209/20412911c2d546918e539c4a6c360a65 [2025-02-06 08:48:32,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:48:32,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:48:32,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:48:32,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:48:32,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:48:32,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:48:32" (1/1) ... [2025-02-06 08:48:32,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8363ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:32, skipping insertion in model container [2025-02-06 08:48:32,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:48:32" (1/1) ... [2025-02-06 08:48:32,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:48:33,058 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/uthash-2.0.2/uthash_SAX_test10-3.i[33022,33035] [2025-02-06 08:48:33,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:48:33,412 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:48:33,479 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/uthash-2.0.2/uthash_SAX_test10-3.i[33022,33035] [2025-02-06 08:48:33,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:48:33,613 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:48:33,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33 WrapperNode [2025-02-06 08:48:33,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:48:33,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:48:33,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:48:33,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:48:33,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:33,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:33,781 INFO L138 Inliner]: procedures = 177, calls = 605, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3609 [2025-02-06 08:48:33,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:48:33,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:48:33,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:48:33,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:48:33,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:33,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:33,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,020 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2025-02-06 08:48:34,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:48:34,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:48:34,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:48:34,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:48:34,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (1/1) ... [2025-02-06 08:48:34,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:48:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:48:34,166 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-02-06 08:48:34,168 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-02-06 08:48:34,226 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 08:48:34,227 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 08:48:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:48:34,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:48:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:48:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:48:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:48:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:48:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:48:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:48:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:48:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:48:34,502 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:48:34,504 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:48:36,852 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:48:37,028 INFO L? ?]: Removed 822 outVars from TransFormulas that were not future-live. [2025-02-06 08:48:37,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:48:37,112 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:48:37,113 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 08:48:37,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:48:37 BoogieIcfgContainer [2025-02-06 08:48:37,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:48:37,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:48:37,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:48:37,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:48:37,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:48:32" (1/3) ... [2025-02-06 08:48:37,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447ff0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:48:37, skipping insertion in model container [2025-02-06 08:48:37,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:33" (2/3) ... [2025-02-06 08:48:37,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447ff0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:48:37, skipping insertion in model container [2025-02-06 08:48:37,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:48:37" (3/3) ... [2025-02-06 08:48:37,121 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-3.i [2025-02-06 08:48:37,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:48:37,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test10-3.i that has 6 procedures, 1090 locations, 1 initial locations, 93 loop locations, and 1 error locations. [2025-02-06 08:48:37,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:48:37,210 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;@3119679d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:48:37,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:48:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 1082 states, 1063 states have (on average 1.6227657572906868) internal successors, (1725), 1068 states have internal predecessors, (1725), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 08:48:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 08:48:37,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:37,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:48:37,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1594110978, now seen corresponding path program 1 times [2025-02-06 08:48:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457944259] [2025-02-06 08:48:37,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 08:48:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 08:48:37,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:37,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:48:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457944259] [2025-02-06 08:48:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457944259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:37,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:48:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861211899] [2025-02-06 08:48:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:37,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:48:37,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:37,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:48:37,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:48:37,383 INFO L87 Difference]: Start difference. First operand has 1082 states, 1063 states have (on average 1.6227657572906868) internal successors, (1725), 1068 states have internal predecessors, (1725), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:37,625 INFO L93 Difference]: Finished difference Result 2162 states and 3512 transitions. [2025-02-06 08:48:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:48:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 08:48:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:37,644 INFO L225 Difference]: With dead ends: 2162 [2025-02-06 08:48:37,645 INFO L226 Difference]: Without dead ends: 1018 [2025-02-06 08:48:37,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:48:37,655 INFO L435 NwaCegarLoop]: 1468 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:37,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1468 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-02-06 08:48:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-02-06 08:48:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1000 states have (on average 1.476) internal successors, (1476), 1005 states have internal predecessors, (1476), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:48:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1503 transitions. [2025-02-06 08:48:37,777 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1503 transitions. Word has length 13 [2025-02-06 08:48:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:37,778 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1503 transitions. [2025-02-06 08:48:37,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1503 transitions. [2025-02-06 08:48:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:48:37,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:37,783 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-02-06 08:48:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:48:37,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1577948944, now seen corresponding path program 1 times [2025-02-06 08:48:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741259746] [2025-02-06 08:48:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:48:37,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:48:37,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:37,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:48:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741259746] [2025-02-06 08:48:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741259746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:48:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460278820] [2025-02-06 08:48:38,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:48:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:38,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:48:38,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:48:38,214 INFO L87 Difference]: Start difference. First operand 1018 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:38,653 INFO L93 Difference]: Finished difference Result 2030 states and 3000 transitions. [2025-02-06 08:48:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:48:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:48:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:38,658 INFO L225 Difference]: With dead ends: 2030 [2025-02-06 08:48:38,659 INFO L226 Difference]: Without dead ends: 1400 [2025-02-06 08:48:38,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:48:38,660 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 544 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:38,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4227 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:48:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-06 08:48:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1020. [2025-02-06 08:48:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1002 states have (on average 1.4750499001996007) internal successors, (1478), 1007 states have internal predecessors, (1478), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:48:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1505 transitions. [2025-02-06 08:48:38,688 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1505 transitions. Word has length 67 [2025-02-06 08:48:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:38,688 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1505 transitions. [2025-02-06 08:48:38,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1505 transitions. [2025-02-06 08:48:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 08:48:38,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:38,695 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:48:38,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -249294030, now seen corresponding path program 1 times [2025-02-06 08:48:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868379462] [2025-02-06 08:48:38,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:38,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 08:48:38,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 08:48:38,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:38,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:48:39,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868379462] [2025-02-06 08:48:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868379462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:39,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:39,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:48:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065865662] [2025-02-06 08:48:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:39,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:48:39,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:39,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:48:39,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:48:39,273 INFO L87 Difference]: Start difference. First operand 1020 states and 1505 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:39,681 INFO L93 Difference]: Finished difference Result 2416 states and 3561 transitions. [2025-02-06 08:48:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:48:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-02-06 08:48:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:39,687 INFO L225 Difference]: With dead ends: 2416 [2025-02-06 08:48:39,688 INFO L226 Difference]: Without dead ends: 1400 [2025-02-06 08:48:39,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:48:39,692 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 1082 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 4737 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:39,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 4737 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:48:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-02-06 08:48:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1023. [2025-02-06 08:48:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:48:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2025-02-06 08:48:39,726 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 143 [2025-02-06 08:48:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2025-02-06 08:48:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2025-02-06 08:48:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-06 08:48:39,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:39,732 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:39,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:48:39,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:39,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1433284258, now seen corresponding path program 1 times [2025-02-06 08:48:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184673822] [2025-02-06 08:48:39,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:39,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 08:48:39,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 08:48:39,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:39,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:48:40,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:40,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184673822] [2025-02-06 08:48:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184673822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:40,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:48:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608944838] [2025-02-06 08:48:40,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:48:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:40,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:48:40,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:48:40,065 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:40,587 INFO L93 Difference]: Finished difference Result 1997 states and 2943 transitions. [2025-02-06 08:48:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:48:40,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-06 08:48:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:40,595 INFO L225 Difference]: With dead ends: 1997 [2025-02-06 08:48:40,595 INFO L226 Difference]: Without dead ends: 981 [2025-02-06 08:48:40,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:48:40,597 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 30 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:40,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3854 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:48:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-02-06 08:48:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-02-06 08:48:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 963 states have (on average 1.4579439252336448) internal successors, (1404), 968 states have internal predecessors, (1404), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 08:48:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1431 transitions. [2025-02-06 08:48:40,673 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1431 transitions. Word has length 213 [2025-02-06 08:48:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:40,675 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1431 transitions. [2025-02-06 08:48:40,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1431 transitions. [2025-02-06 08:48:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-06 08:48:40,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:40,689 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:40,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:48:40,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:40,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash -852095716, now seen corresponding path program 1 times [2025-02-06 08:48:40,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:40,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738593609] [2025-02-06 08:48:40,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 08:48:40,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 08:48:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:48:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738593609] [2025-02-06 08:48:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738593609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:48:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634553652] [2025-02-06 08:48:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:48:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:41,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:48:41,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:48:41,036 INFO L87 Difference]: Start difference. First operand 981 states and 1431 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:41,294 INFO L93 Difference]: Finished difference Result 2482 states and 3634 transitions. [2025-02-06 08:48:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:48:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-02-06 08:48:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:41,303 INFO L225 Difference]: With dead ends: 2482 [2025-02-06 08:48:41,303 INFO L226 Difference]: Without dead ends: 1508 [2025-02-06 08:48:41,305 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-02-06 08:48:41,307 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 713 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:41,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 2596 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-02-06 08:48:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1350. [2025-02-06 08:48:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1330 states have (on average 1.4609022556390978) internal successors, (1943), 1335 states have internal predecessors, (1943), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:48:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1974 transitions. [2025-02-06 08:48:41,346 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1974 transitions. Word has length 213 [2025-02-06 08:48:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:41,348 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1974 transitions. [2025-02-06 08:48:41,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:48:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1974 transitions. [2025-02-06 08:48:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-06 08:48:41,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:41,352 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:48:41,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -536756218, now seen corresponding path program 1 times [2025-02-06 08:48:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929888757] [2025-02-06 08:48:41,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:41,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-06 08:48:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-06 08:48:41,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:41,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:48:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929888757] [2025-02-06 08:48:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929888757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:48:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590212056] [2025-02-06 08:48:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:48:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:41,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:48:41,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:48:41,753 INFO L87 Difference]: Start difference. First operand 1350 states and 1974 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:48:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:41,984 INFO L93 Difference]: Finished difference Result 2567 states and 3760 transitions. [2025-02-06 08:48:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:48:41,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2025-02-06 08:48:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:41,990 INFO L225 Difference]: With dead ends: 2567 [2025-02-06 08:48:41,990 INFO L226 Difference]: Without dead ends: 1308 [2025-02-06 08:48:41,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:48:41,992 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 30 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:41,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3632 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-06 08:48:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2025-02-06 08:48:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1288 states have (on average 1.4487577639751552) internal successors, (1866), 1293 states have internal predecessors, (1866), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 08:48:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1897 transitions. [2025-02-06 08:48:42,017 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1897 transitions. Word has length 228 [2025-02-06 08:48:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:42,018 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1897 transitions. [2025-02-06 08:48:42,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:48:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1897 transitions. [2025-02-06 08:48:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-06 08:48:42,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:42,020 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:42,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:48:42,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 779884928, now seen corresponding path program 1 times [2025-02-06 08:48:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026008331] [2025-02-06 08:48:42,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:42,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-06 08:48:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-06 08:48:42,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:48:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:42,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026008331] [2025-02-06 08:48:42,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026008331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:42,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:48:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278191553] [2025-02-06 08:48:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:42,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:48:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:42,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:48:42,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:48:42,325 INFO L87 Difference]: Start difference. First operand 1308 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:48:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:42,556 INFO L93 Difference]: Finished difference Result 3091 states and 4501 transitions. [2025-02-06 08:48:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:48:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2025-02-06 08:48:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:42,564 INFO L225 Difference]: With dead ends: 3091 [2025-02-06 08:48:42,564 INFO L226 Difference]: Without dead ends: 1874 [2025-02-06 08:48:42,566 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-02-06 08:48:42,566 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 593 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:42,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2806 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-02-06 08:48:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1869. [2025-02-06 08:48:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.4519804666304938) internal successors, (2676), 1848 states have internal predecessors, (2676), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 08:48:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2719 transitions. [2025-02-06 08:48:42,612 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2719 transitions. Word has length 228 [2025-02-06 08:48:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2719 transitions. [2025-02-06 08:48:42,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:48:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2719 transitions. [2025-02-06 08:48:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-06 08:48:42,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:42,616 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:48:42,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1602663334, now seen corresponding path program 1 times [2025-02-06 08:48:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567381386] [2025-02-06 08:48:42,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:42,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-06 08:48:42,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-06 08:48:42,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:42,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567381386] [2025-02-06 08:48:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567381386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:48:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215900356] [2025-02-06 08:48:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:48:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:42,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:48:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:48:42,930 INFO L87 Difference]: Start difference. First operand 1869 states and 2719 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 08:48:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:43,323 INFO L93 Difference]: Finished difference Result 3077 states and 4483 transitions. [2025-02-06 08:48:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:48:43,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 243 [2025-02-06 08:48:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:43,330 INFO L225 Difference]: With dead ends: 3077 [2025-02-06 08:48:43,330 INFO L226 Difference]: Without dead ends: 1443 [2025-02-06 08:48:43,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:48:43,333 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 2357 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:43,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 1446 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:48:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-02-06 08:48:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2025-02-06 08:48:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1422 states have (on average 1.4374120956399437) internal successors, (2044), 1427 states have internal predecessors, (2044), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:48:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2077 transitions. [2025-02-06 08:48:43,368 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2077 transitions. Word has length 243 [2025-02-06 08:48:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:43,370 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2077 transitions. [2025-02-06 08:48:43,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 08:48:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2077 transitions. [2025-02-06 08:48:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:48:43,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:43,373 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:43,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:48:43,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:43,374 INFO L85 PathProgramCache]: Analyzing trace with hash 217592972, now seen corresponding path program 1 times [2025-02-06 08:48:43,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:43,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275855449] [2025-02-06 08:48:43,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:43,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:48:43,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:48:43,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:43,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 08:48:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275855449] [2025-02-06 08:48:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275855449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:43,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:43,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:48:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113890579] [2025-02-06 08:48:43,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:43,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:48:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:43,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:48:43,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:48:43,701 INFO L87 Difference]: Start difference. First operand 1443 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:43,922 INFO L93 Difference]: Finished difference Result 2322 states and 3385 transitions. [2025-02-06 08:48:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:48:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:48:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:43,929 INFO L225 Difference]: With dead ends: 2322 [2025-02-06 08:48:43,929 INFO L226 Difference]: Without dead ends: 1463 [2025-02-06 08:48:43,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 08:48:43,932 INFO L435 NwaCegarLoop]: 1213 mSDtfsCounter, 8 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:43,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2411 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-02-06 08:48:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2025-02-06 08:48:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1442 states have (on average 1.4313453536754508) internal successors, (2064), 1447 states have internal predecessors, (2064), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:48:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2097 transitions. [2025-02-06 08:48:43,974 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2097 transitions. Word has length 253 [2025-02-06 08:48:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2097 transitions. [2025-02-06 08:48:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2097 transitions. [2025-02-06 08:48:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:48:43,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:43,978 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:43,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:48:43,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash -751988051, now seen corresponding path program 1 times [2025-02-06 08:48:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:43,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650578216] [2025-02-06 08:48:43,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:48:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:48:44,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:44,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 08:48:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650578216] [2025-02-06 08:48:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650578216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:44,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:48:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:48:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237070241] [2025-02-06 08:48:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:44,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:48:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:44,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:48:44,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:48:44,319 INFO L87 Difference]: Start difference. First operand 1463 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:44,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:44,542 INFO L93 Difference]: Finished difference Result 2332 states and 3388 transitions. [2025-02-06 08:48:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:48:44,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:48:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:44,549 INFO L225 Difference]: With dead ends: 2332 [2025-02-06 08:48:44,549 INFO L226 Difference]: Without dead ends: 1401 [2025-02-06 08:48:44,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:48:44,552 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 32 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:44,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3400 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:48:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-02-06 08:48:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1401. [2025-02-06 08:48:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1380 states have (on average 1.4231884057971014) internal successors, (1964), 1385 states have internal predecessors, (1964), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:48:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1997 transitions. [2025-02-06 08:48:44,586 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1997 transitions. Word has length 253 [2025-02-06 08:48:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 1401 states and 1997 transitions. [2025-02-06 08:48:44,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1997 transitions. [2025-02-06 08:48:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-06 08:48:44,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:44,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:44,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:48:44,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2137931770, now seen corresponding path program 1 times [2025-02-06 08:48:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422616789] [2025-02-06 08:48:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:44,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:48:44,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:48:44,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:44,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:45,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:45,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422616789] [2025-02-06 08:48:45,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422616789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:48:45,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149893080] [2025-02-06 08:48:45,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:45,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:48:45,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:48:45,517 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-02-06 08:48:45,518 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-02-06 08:48:45,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-06 08:48:46,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-06 08:48:46,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:46,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:46,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:48:46,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:48:46,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:46,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:48:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:46,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:48:46,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149893080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:48:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:48:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-06 08:48:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29108061] [2025-02-06 08:48:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:48:46,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:48:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:46,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:48:46,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:48:46,780 INFO L87 Difference]: Start difference. First operand 1401 states and 1997 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:47,532 INFO L93 Difference]: Finished difference Result 2595 states and 3714 transitions. [2025-02-06 08:48:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:48:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 253 [2025-02-06 08:48:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:47,540 INFO L225 Difference]: With dead ends: 2595 [2025-02-06 08:48:47,541 INFO L226 Difference]: Without dead ends: 1722 [2025-02-06 08:48:47,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 242 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:48:47,544 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 2453 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:47,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 4106 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:48:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-02-06 08:48:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1570. [2025-02-06 08:48:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1539 states have (on average 1.4152046783625731) internal successors, (2178), 1548 states have internal predecessors, (2178), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 08:48:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2225 transitions. [2025-02-06 08:48:47,596 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2225 transitions. Word has length 253 [2025-02-06 08:48:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:47,597 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2225 transitions. [2025-02-06 08:48:47,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:48:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2225 transitions. [2025-02-06 08:48:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-02-06 08:48:47,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:47,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:47,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:48:47,802 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,SelfDestructingSolverStorable10 [2025-02-06 08:48:47,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:47,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1957697086, now seen corresponding path program 1 times [2025-02-06 08:48:47,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:47,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445801443] [2025-02-06 08:48:47,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:47,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 08:48:47,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 08:48:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:48,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445801443] [2025-02-06 08:48:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445801443] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:48:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233692531] [2025-02-06 08:48:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:48,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:48:48,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:48:48,815 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-02-06 08:48:48,817 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-02-06 08:48:49,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-02-06 08:48:49,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-02-06 08:48:49,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:49,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 08:48:49,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:48:49,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 08:48:49,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:49,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:48:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:49,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:48:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233692531] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:48:50,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:48:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-02-06 08:48:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932111139] [2025-02-06 08:48:50,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:48:50,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:48:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:48:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:48:50,159 INFO L87 Difference]: Start difference. First operand 1570 states and 2225 transitions. Second operand has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:48:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:48:50,934 INFO L93 Difference]: Finished difference Result 3837 states and 5391 transitions. [2025-02-06 08:48:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 08:48:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 329 [2025-02-06 08:48:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:48:50,943 INFO L225 Difference]: With dead ends: 3837 [2025-02-06 08:48:50,944 INFO L226 Difference]: Without dead ends: 2502 [2025-02-06 08:48:50,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 647 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:48:50,947 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 2525 mSDsluCounter, 5215 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 6342 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:48:50,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 6342 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:48:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2025-02-06 08:48:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2218. [2025-02-06 08:48:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2175 states have (on average 1.3912643678160919) internal successors, (3026), 2184 states have internal predecessors, (3026), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 08:48:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3095 transitions. [2025-02-06 08:48:51,010 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3095 transitions. Word has length 329 [2025-02-06 08:48:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:48:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 3095 transitions. [2025-02-06 08:48:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:48:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3095 transitions. [2025-02-06 08:48:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-02-06 08:48:51,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:48:51,021 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:48:51,033 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-02-06 08:48:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:48:51,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:48:51,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:48:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1436943668, now seen corresponding path program 1 times [2025-02-06 08:48:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:48:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278525123] [2025-02-06 08:48:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:48:51,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-02-06 08:48:51,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-02-06 08:48:51,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:51,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:48:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278525123] [2025-02-06 08:48:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278525123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:48:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374412618] [2025-02-06 08:48:56,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:48:56,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:48:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:48:56,501 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-02-06 08:48:56,503 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-02-06 08:48:57,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-02-06 08:48:57,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-02-06 08:48:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:48:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:48:57,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 08:48:57,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:48:57,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 08:48:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:58,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:58,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:48:58,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:48:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:58,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:48:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 292 proven. 884 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:48:59,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374412618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:48:59,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:48:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-02-06 08:48:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111906564] [2025-02-06 08:48:59,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:48:59,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 08:48:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:48:59,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 08:48:59,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-02-06 08:48:59,278 INFO L87 Difference]: Start difference. First operand 2218 states and 3095 transitions. Second operand has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:49:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:00,693 INFO L93 Difference]: Finished difference Result 5571 states and 7734 transitions. [2025-02-06 08:49:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 08:49:00,693 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 767 [2025-02-06 08:49:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:00,706 INFO L225 Difference]: With dead ends: 5571 [2025-02-06 08:49:00,706 INFO L226 Difference]: Without dead ends: 4236 [2025-02-06 08:49:00,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1557 GetRequests, 1521 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-02-06 08:49:00,708 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 4026 mSDsluCounter, 13034 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4068 SdHoareTripleChecker+Valid, 14161 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:00,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4068 Valid, 14161 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 08:49:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2025-02-06 08:49:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 3952. [2025-02-06 08:49:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3885 states have (on average 1.3688545688545688) internal successors, (5318), 3894 states have internal predecessors, (5318), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:49:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5435 transitions. [2025-02-06 08:49:00,787 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5435 transitions. Word has length 767 [2025-02-06 08:49:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5435 transitions. [2025-02-06 08:49:00,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.85714285714286) internal successors, (1362), 21 states have internal predecessors, (1362), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:49:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5435 transitions. [2025-02-06 08:49:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1644 [2025-02-06 08:49:00,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:00,844 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:00,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 08:49:01,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:49:01,045 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 259088280, now seen corresponding path program 2 times [2025-02-06 08:49:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:01,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180652256] [2025-02-06 08:49:01,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:49:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:01,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1643 statements into 2 equivalence classes. [2025-02-06 08:49:01,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 77 of 1643 statements. [2025-02-06 08:49:01,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:49:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:49:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180652256] [2025-02-06 08:49:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180652256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:49:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604452223] [2025-02-06 08:49:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:49:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:01,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:49:01,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:01,592 INFO L87 Difference]: Start difference. First operand 3952 states and 5435 transitions. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:02,244 INFO L93 Difference]: Finished difference Result 4814 states and 6717 transitions. [2025-02-06 08:49:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1643 [2025-02-06 08:49:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:02,262 INFO L225 Difference]: With dead ends: 4814 [2025-02-06 08:49:02,262 INFO L226 Difference]: Without dead ends: 3963 [2025-02-06 08:49:02,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:49:02,264 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 53 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:02,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6543 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2025-02-06 08:49:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3959. [2025-02-06 08:49:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3892 states have (on average 1.3681911613566289) internal successors, (5325), 3901 states have internal predecessors, (5325), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:49:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5442 transitions. [2025-02-06 08:49:02,328 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5442 transitions. Word has length 1643 [2025-02-06 08:49:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:02,330 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 5442 transitions. [2025-02-06 08:49:02,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5442 transitions. [2025-02-06 08:49:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-06 08:49:02,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:02,346 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:02,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:49:02,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1130748671, now seen corresponding path program 1 times [2025-02-06 08:49:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101015582] [2025-02-06 08:49:02,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:02,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-06 08:49:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-06 08:49:03,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:03,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:49:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101015582] [2025-02-06 08:49:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101015582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:49:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182925434] [2025-02-06 08:49:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:06,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:49:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:06,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:49:06,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:06,905 INFO L87 Difference]: Start difference. First operand 3959 states and 5442 transitions. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:07,425 INFO L93 Difference]: Finished difference Result 4808 states and 6703 transitions. [2025-02-06 08:49:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-06 08:49:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:07,450 INFO L225 Difference]: With dead ends: 4808 [2025-02-06 08:49:07,451 INFO L226 Difference]: Without dead ends: 3967 [2025-02-06 08:49:07,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:07,455 INFO L435 NwaCegarLoop]: 1149 mSDtfsCounter, 25 mSDsluCounter, 5430 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6579 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:07,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6579 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2025-02-06 08:49:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3959. [2025-02-06 08:49:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3892 states have (on average 1.3681911613566289) internal successors, (5325), 3901 states have internal predecessors, (5325), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:49:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5442 transitions. [2025-02-06 08:49:07,659 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5442 transitions. Word has length 1644 [2025-02-06 08:49:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:07,661 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 5442 transitions. [2025-02-06 08:49:07,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5442 transitions. [2025-02-06 08:49:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-02-06 08:49:07,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:07,692 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:07,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:49:07,693 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:07,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1448668730, now seen corresponding path program 1 times [2025-02-06 08:49:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989873747] [2025-02-06 08:49:07,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:08,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-02-06 08:49:08,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-02-06 08:49:08,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:49:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989873747] [2025-02-06 08:49:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989873747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:12,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349628763] [2025-02-06 08:49:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:12,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:12,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:12,384 INFO L87 Difference]: Start difference. First operand 3959 states and 5442 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:12,995 INFO L93 Difference]: Finished difference Result 4814 states and 6712 transitions. [2025-02-06 08:49:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1644 [2025-02-06 08:49:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:13,004 INFO L225 Difference]: With dead ends: 4814 [2025-02-06 08:49:13,005 INFO L226 Difference]: Without dead ends: 3964 [2025-02-06 08:49:13,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:13,007 INFO L435 NwaCegarLoop]: 1150 mSDtfsCounter, 17 mSDsluCounter, 5384 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6534 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:13,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6534 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-02-06 08:49:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3963. [2025-02-06 08:49:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3896 states have (on average 1.3680698151950719) internal successors, (5330), 3905 states have internal predecessors, (5330), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:49:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5447 transitions. [2025-02-06 08:49:13,103 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5447 transitions. Word has length 1644 [2025-02-06 08:49:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 5447 transitions. [2025-02-06 08:49:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5447 transitions. [2025-02-06 08:49:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-02-06 08:49:13,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:13,136 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:13,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:49:13,137 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -197000385, now seen corresponding path program 1 times [2025-02-06 08:49:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094844106] [2025-02-06 08:49:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:13,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-02-06 08:49:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-02-06 08:49:14,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:14,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7338 trivial. 0 not checked. [2025-02-06 08:49:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094844106] [2025-02-06 08:49:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094844106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:17,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:17,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584302769] [2025-02-06 08:49:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:17,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:17,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:17,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:17,997 INFO L87 Difference]: Start difference. First operand 3963 states and 5447 transitions. Second operand has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:18,610 INFO L93 Difference]: Finished difference Result 4820 states and 6719 transitions. [2025-02-06 08:49:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1645 [2025-02-06 08:49:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:18,619 INFO L225 Difference]: With dead ends: 4820 [2025-02-06 08:49:18,619 INFO L226 Difference]: Without dead ends: 3974 [2025-02-06 08:49:18,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:49:18,622 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 31 mSDsluCounter, 7659 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8806 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:18,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8806 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2025-02-06 08:49:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3971. [2025-02-06 08:49:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3904 states have (on average 1.367827868852459) internal successors, (5340), 3913 states have internal predecessors, (5340), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 08:49:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5457 transitions. [2025-02-06 08:49:18,688 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5457 transitions. Word has length 1645 [2025-02-06 08:49:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:18,689 INFO L471 AbstractCegarLoop]: Abstraction has 3971 states and 5457 transitions. [2025-02-06 08:49:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.88888888888889) internal successors, (242), 9 states have internal predecessors, (242), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5457 transitions. [2025-02-06 08:49:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1647 [2025-02-06 08:49:18,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:18,707 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:18,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:49:18,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -839081923, now seen corresponding path program 1 times [2025-02-06 08:49:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700296240] [2025-02-06 08:49:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:19,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 08:49:19,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 08:49:19,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:19,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 1988 proven. 75 refuted. 0 times theorem prover too weak. 5275 trivial. 0 not checked. [2025-02-06 08:49:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700296240] [2025-02-06 08:49:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700296240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:49:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446269719] [2025-02-06 08:49:24,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:49:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:49:24,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:49:24,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 08:49:25,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1646 statements into 1 equivalence classes. [2025-02-06 08:49:26,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1646 of 1646 statements. [2025-02-06 08:49:26,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:26,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:26,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 8006 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 08:49:26,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:49:27,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:27,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:28,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:28,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:28,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:28,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:49:28,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:49:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:28,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:49:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7338 backedges. 42 proven. 7272 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446269719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:49:30,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:49:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-02-06 08:49:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202679738] [2025-02-06 08:49:30,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:49:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 08:49:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:30,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 08:49:30,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 08:49:30,404 INFO L87 Difference]: Start difference. First operand 3971 states and 5457 transitions. Second operand has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:32,938 INFO L93 Difference]: Finished difference Result 8225 states and 11319 transitions. [2025-02-06 08:49:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-02-06 08:49:32,939 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1646 [2025-02-06 08:49:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:32,955 INFO L225 Difference]: With dead ends: 8225 [2025-02-06 08:49:32,955 INFO L226 Difference]: Without dead ends: 7317 [2025-02-06 08:49:32,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3348 GetRequests, 3262 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-02-06 08:49:32,961 INFO L435 NwaCegarLoop]: 1094 mSDtfsCounter, 9396 mSDsluCounter, 11549 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9468 SdHoareTripleChecker+Valid, 12643 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:32,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9468 Valid, 12643 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 08:49:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2025-02-06 08:49:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 7315. [2025-02-06 08:49:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7315 states, 7182 states have (on average 1.353104984683932) internal successors, (9718), 7191 states have internal predecessors, (9718), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 08:49:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 9967 transitions. [2025-02-06 08:49:33,072 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 9967 transitions. Word has length 1646 [2025-02-06 08:49:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:33,073 INFO L471 AbstractCegarLoop]: Abstraction has 7315 states and 9967 transitions. [2025-02-06 08:49:33,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 98.44117647058823) internal successors, (3347), 34 states have internal predecessors, (3347), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 9967 transitions. [2025-02-06 08:49:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2025-02-06 08:49:33,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:33,126 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:33,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 08:49:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 08:49:33,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:33,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -264519403, now seen corresponding path program 2 times [2025-02-06 08:49:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31023019] [2025-02-06 08:49:33,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:49:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:34,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3318 statements into 2 equivalence classes. [2025-02-06 08:49:34,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 3318 statements. [2025-02-06 08:49:34,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:49:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43286 trivial. 0 not checked. [2025-02-06 08:49:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31023019] [2025-02-06 08:49:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31023019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:34,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 08:49:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874569858] [2025-02-06 08:49:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:34,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:49:34,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:34,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:49:34,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:49:34,363 INFO L87 Difference]: Start difference. First operand 7315 states and 9967 transitions. Second operand has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:35,476 INFO L93 Difference]: Finished difference Result 8186 states and 11257 transitions. [2025-02-06 08:49:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 08:49:35,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3318 [2025-02-06 08:49:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:35,492 INFO L225 Difference]: With dead ends: 8186 [2025-02-06 08:49:35,493 INFO L226 Difference]: Without dead ends: 7360 [2025-02-06 08:49:35,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:49:35,496 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 85 mSDsluCounter, 11090 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:35,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 12244 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:49:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2025-02-06 08:49:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7321. [2025-02-06 08:49:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7188 states have (on average 1.3530884808013355) internal successors, (9726), 7197 states have internal predecessors, (9726), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 08:49:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 9975 transitions. [2025-02-06 08:49:35,603 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 9975 transitions. Word has length 3318 [2025-02-06 08:49:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:35,608 INFO L471 AbstractCegarLoop]: Abstraction has 7321 states and 9975 transitions. [2025-02-06 08:49:35,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 9975 transitions. [2025-02-06 08:49:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3319 [2025-02-06 08:49:35,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:35,662 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:35,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:49:35,662 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:35,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash 219654075, now seen corresponding path program 1 times [2025-02-06 08:49:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:35,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168643673] [2025-02-06 08:49:35,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:36,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3318 statements into 1 equivalence classes. [2025-02-06 08:49:38,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3318 of 3318 statements. [2025-02-06 08:49:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:38,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 43286 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43286 trivial. 0 not checked. [2025-02-06 08:49:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168643673] [2025-02-06 08:49:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168643673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:46,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223230788] [2025-02-06 08:49:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:46,094 INFO L87 Difference]: Start difference. First operand 7321 states and 9975 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:46,469 INFO L93 Difference]: Finished difference Result 8176 states and 11245 transitions. [2025-02-06 08:49:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3318 [2025-02-06 08:49:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:46,484 INFO L225 Difference]: With dead ends: 8176 [2025-02-06 08:49:46,485 INFO L226 Difference]: Without dead ends: 7324 [2025-02-06 08:49:46,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:46,488 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 16 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:46,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5494 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:49:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2025-02-06 08:49:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 7324. [2025-02-06 08:49:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 7191 states have (on average 1.3529411764705883) internal successors, (9729), 7200 states have internal predecessors, (9729), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-02-06 08:49:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9978 transitions. [2025-02-06 08:49:46,665 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9978 transitions. Word has length 3318 [2025-02-06 08:49:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:46,667 INFO L471 AbstractCegarLoop]: Abstraction has 7324 states and 9978 transitions. [2025-02-06 08:49:46,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 08:49:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9978 transitions. [2025-02-06 08:49:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3320 [2025-02-06 08:49:46,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:46,766 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:46,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:49:46,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:46,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash 117906544, now seen corresponding path program 1 times [2025-02-06 08:49:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:46,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120184202] [2025-02-06 08:49:46,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:47,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3319 statements into 1 equivalence classes.