./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:21:43,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:21:43,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:21:43,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:21:43,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:21:43,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:21:43,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:21:43,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:21:43,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:21:43,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:21:43,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:21:43,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:21:43,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:21:43,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:21:43,982 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:21:43,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:21:43,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:21:43,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:21:43,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:21:43,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:21:43,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:21:43,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:21:43,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:21:43,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:21:43,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:21:43,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2025-03-08 21:21:44,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:21:44,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:21:44,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:21:44,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:21:44,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:21:44,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2025-03-08 21:21:45,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e022f2/1e491942fd084095a02575f5bcf2b784/FLAGe0044d864 [2025-03-08 21:21:45,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:21:45,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2025-03-08 21:21:45,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e022f2/1e491942fd084095a02575f5bcf2b784/FLAGe0044d864 [2025-03-08 21:21:45,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e022f2/1e491942fd084095a02575f5bcf2b784 [2025-03-08 21:21:45,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:21:45,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:21:45,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:21:45,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:21:45,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:21:45,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:21:45" (1/1) ... [2025-03-08 21:21:45,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b70be81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:45, skipping insertion in model container [2025-03-08 21:21:45,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:21:45" (1/1) ... [2025-03-08 21:21:45,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:21:46,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i[33021,33034] [2025-03-08 21:21:46,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i[45234,45247] [2025-03-08 21:21:46,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:21:46,318 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:21:46,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i[33021,33034] [2025-03-08 21:21:46,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i[45234,45247] [2025-03-08 21:21:46,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:21:46,409 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:21:46,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46 WrapperNode [2025-03-08 21:21:46,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:21:46,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:21:46,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:21:46,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:21:46,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,507 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-03-08 21:21:46,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:21:46,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:21:46,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:21:46,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:21:46,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,620 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-03-08 21:21:46,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:21:46,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:21:46,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:21:46,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:21:46,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (1/1) ... [2025-03-08 21:21:46,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:21:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:46,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:21:46,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:21:46,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:21:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:21:46,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:21:46,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:21:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:21:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-08 21:21:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:21:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:21:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:21:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:21:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:21:46,933 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:21:46,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:21:48,081 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: 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-03-08 21:21:48,183 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-03-08 21:21:48,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:21:48,224 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:21:48,226 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:21:48,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:21:48 BoogieIcfgContainer [2025-03-08 21:21:48,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:21:48,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:21:48,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:21:48,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:21:48,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:21:45" (1/3) ... [2025-03-08 21:21:48,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d632f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:21:48, skipping insertion in model container [2025-03-08 21:21:48,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:21:46" (2/3) ... [2025-03-08 21:21:48,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d632f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:21:48, skipping insertion in model container [2025-03-08 21:21:48,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:21:48" (3/3) ... [2025-03-08 21:21:48,233 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-2.i [2025-03-08 21:21:48,244 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:21:48,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test8-2.i that has 6 procedures, 471 locations, 1 initial locations, 40 loop locations, and 2 error locations. [2025-03-08 21:21:48,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:21:48,298 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;@5a97fef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:21:48,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 21:21:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 21:21:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 21:21:48,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:48,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:21:48,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 620726640, now seen corresponding path program 1 times [2025-03-08 21:21:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070990820] [2025-03-08 21:21:48,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:48,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 21:21:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 21:21:48,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:48,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070990820] [2025-03-08 21:21:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070990820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:21:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766126047] [2025-03-08 21:21:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:48,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:21:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:48,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:21:48,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:21:48,458 INFO L87 Difference]: Start difference. First operand has 463 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:48,581 INFO L93 Difference]: Finished difference Result 924 states and 1517 transitions. [2025-03-08 21:21:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:21:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 21:21:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:48,589 INFO L225 Difference]: With dead ends: 924 [2025-03-08 21:21:48,589 INFO L226 Difference]: Without dead ends: 426 [2025-03-08 21:21:48,593 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-03-08 21:21:48,596 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:48,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-08 21:21:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-08 21:21:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 401 states have (on average 1.4688279301745637) internal successors, (589), 417 states have internal predecessors, (589), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 21:21:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 629 transitions. [2025-03-08 21:21:48,654 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 629 transitions. Word has length 9 [2025-03-08 21:21:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:48,654 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 629 transitions. [2025-03-08 21:21:48,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 629 transitions. [2025-03-08 21:21:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 21:21:48,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:48,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:21:48,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:21:48,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 296388285, now seen corresponding path program 1 times [2025-03-08 21:21:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:48,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002515978] [2025-03-08 21:21:48,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:48,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:21:48,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:21:48,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:48,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002515978] [2025-03-08 21:21:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002515978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:49,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:49,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:21:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965892540] [2025-03-08 21:21:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:49,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:21:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:49,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:21:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:21:49,056 INFO L87 Difference]: Start difference. First operand 426 states and 629 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:49,292 INFO L93 Difference]: Finished difference Result 1031 states and 1523 transitions. [2025-03-08 21:21:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:21:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-08 21:21:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:49,296 INFO L225 Difference]: With dead ends: 1031 [2025-03-08 21:21:49,296 INFO L226 Difference]: Without dead ends: 805 [2025-03-08 21:21:49,297 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-03-08 21:21:49,297 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 541 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:49,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1696 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:21:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-08 21:21:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 428. [2025-03-08 21:21:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 21:21:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2025-03-08 21:21:49,337 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 62 [2025-03-08 21:21:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2025-03-08 21:21:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:21:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2025-03-08 21:21:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 21:21:49,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:49,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:21:49,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:21:49,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:49,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1479029304, now seen corresponding path program 1 times [2025-03-08 21:21:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405410190] [2025-03-08 21:21:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:49,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:21:49,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:21:49,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:49,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:49,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405410190] [2025-03-08 21:21:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405410190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:49,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:21:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787469305] [2025-03-08 21:21:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:21:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:49,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:21:49,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:21:49,588 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 21:21:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:49,733 INFO L93 Difference]: Finished difference Result 810 states and 1192 transitions. [2025-03-08 21:21:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:21:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 83 [2025-03-08 21:21:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:49,736 INFO L225 Difference]: With dead ends: 810 [2025-03-08 21:21:49,737 INFO L226 Difference]: Without dead ends: 386 [2025-03-08 21:21:49,738 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-03-08 21:21:49,741 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 30 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:49,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1466 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-08 21:21:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-08 21:21:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.4238227146814404) internal successors, (514), 377 states have internal predecessors, (514), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 21:21:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 554 transitions. [2025-03-08 21:21:49,763 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 554 transitions. Word has length 83 [2025-03-08 21:21:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:49,764 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 554 transitions. [2025-03-08 21:21:49,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-08 21:21:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 554 transitions. [2025-03-08 21:21:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 21:21:49,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:49,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:21:49,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:21:49,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -929024782, now seen corresponding path program 1 times [2025-03-08 21:21:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675951759] [2025-03-08 21:21:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:49,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:21:49,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:21:49,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:49,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:21:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675951759] [2025-03-08 21:21:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675951759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:49,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:21:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944969468] [2025-03-08 21:21:49,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:21:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:49,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:21:49,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:49,935 INFO L87 Difference]: Start difference. First operand 386 states and 554 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-03-08 21:21:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:50,086 INFO L93 Difference]: Finished difference Result 1016 states and 1462 transitions. [2025-03-08 21:21:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:21:50,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 83 [2025-03-08 21:21:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:50,089 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 21:21:50,089 INFO L226 Difference]: Without dead ends: 634 [2025-03-08 21:21:50,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:21:50,090 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 293 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:50,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1171 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:21:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-08 21:21:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-03-08 21:21:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.431404958677686) internal successors, (866), 621 states have internal predecessors, (866), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 908 transitions. [2025-03-08 21:21:50,115 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 908 transitions. Word has length 83 [2025-03-08 21:21:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:50,115 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 908 transitions. [2025-03-08 21:21:50,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-03-08 21:21:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 908 transitions. [2025-03-08 21:21:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 21:21:50,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:50,117 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:50,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:21:50,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:50,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 764968475, now seen corresponding path program 1 times [2025-03-08 21:21:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334580639] [2025-03-08 21:21:50,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:50,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 21:21:50,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 21:21:50,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:21:50,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:50,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334580639] [2025-03-08 21:21:50,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334580639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:21:50,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17042803] [2025-03-08 21:21:50,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:50,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:50,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:50,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:21:50,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:21:50,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 21:21:50,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 21:21:50,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:50,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 21:21:50,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:21:50,787 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 11 treesize of output 7 [2025-03-08 21:21:50,811 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 22 treesize of output 7 [2025-03-08 21:21:51,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 21:21:51,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-03-08 21:21:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:21:51,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:21:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17042803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:21:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-08 21:21:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701310980] [2025-03-08 21:21:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:51,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:21:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:51,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:21:51,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:21:51,408 INFO L87 Difference]: Start difference. First operand 631 states and 908 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:52,372 INFO L93 Difference]: Finished difference Result 1515 states and 2181 transitions. [2025-03-08 21:21:52,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:21:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 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 98 [2025-03-08 21:21:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:52,378 INFO L225 Difference]: With dead ends: 1515 [2025-03-08 21:21:52,378 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 21:21:52,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-08 21:21:52,379 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 596 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:52,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2756 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:21:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 21:21:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 631. [2025-03-08 21:21:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.4297520661157024) internal successors, (865), 621 states have internal predecessors, (865), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 907 transitions. [2025-03-08 21:21:52,406 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 907 transitions. Word has length 98 [2025-03-08 21:21:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 907 transitions. [2025-03-08 21:21:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 907 transitions. [2025-03-08 21:21:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 21:21:52,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:52,407 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:52,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:21:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:52,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 730062964, now seen corresponding path program 1 times [2025-03-08 21:21:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287418425] [2025-03-08 21:21:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:52,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:21:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:21:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:21:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287418425] [2025-03-08 21:21:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287418425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:21:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221422406] [2025-03-08 21:21:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:52,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:21:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:21:53,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:21:53,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:21:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:53,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 21:21:53,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:21:53,167 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 11 treesize of output 7 [2025-03-08 21:21:53,181 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 22 treesize of output 7 [2025-03-08 21:21:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:21:53,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:21:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221422406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:21:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-08 21:21:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172810316] [2025-03-08 21:21:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:21:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:53,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:21:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:21:53,819 INFO L87 Difference]: Start difference. First operand 631 states and 907 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:54,965 INFO L93 Difference]: Finished difference Result 1530 states and 2201 transitions. [2025-03-08 21:21:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 21:21:54,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 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 99 [2025-03-08 21:21:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:54,969 INFO L225 Difference]: With dead ends: 1530 [2025-03-08 21:21:54,969 INFO L226 Difference]: Without dead ends: 946 [2025-03-08 21:21:54,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:21:54,971 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 648 mSDsluCounter, 2686 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 3178 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 21:21:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-08 21:21:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 647. [2025-03-08 21:21:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 621 states have (on average 1.4251207729468598) internal successors, (885), 637 states have internal predecessors, (885), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 927 transitions. [2025-03-08 21:21:54,991 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 927 transitions. Word has length 99 [2025-03-08 21:21:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:54,991 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 927 transitions. [2025-03-08 21:21:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 927 transitions. [2025-03-08 21:21:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 21:21:54,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:54,992 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:55,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:21:55,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 21:21:55,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:55,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1157423764, now seen corresponding path program 1 times [2025-03-08 21:21:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7942006] [2025-03-08 21:21:55,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 21:21:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 21:21:55,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:55,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:21:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:55,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7942006] [2025-03-08 21:21:55,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7942006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:21:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808130681] [2025-03-08 21:21:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:55,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:21:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:55,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:21:55,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:21:55,461 INFO L87 Difference]: Start difference. First operand 647 states and 927 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 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-03-08 21:21:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:55,784 INFO L93 Difference]: Finished difference Result 1248 states and 1801 transitions. [2025-03-08 21:21:55,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:21:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 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 100 [2025-03-08 21:21:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:55,790 INFO L225 Difference]: With dead ends: 1248 [2025-03-08 21:21:55,790 INFO L226 Difference]: Without dead ends: 657 [2025-03-08 21:21:55,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:21:55,791 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 14 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:55,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2684 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:21:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-08 21:21:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2025-03-08 21:21:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 629 states have (on average 1.4228934817170111) internal successors, (895), 645 states have internal predecessors, (895), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 937 transitions. [2025-03-08 21:21:55,808 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 937 transitions. Word has length 100 [2025-03-08 21:21:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:55,809 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 937 transitions. [2025-03-08 21:21:55,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 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-03-08 21:21:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 937 transitions. [2025-03-08 21:21:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 21:21:55,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:55,811 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:55,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:21:55,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1649321512, now seen corresponding path program 1 times [2025-03-08 21:21:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012699315] [2025-03-08 21:21:55,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 21:21:55,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 21:21:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:21:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012699315] [2025-03-08 21:21:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012699315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:21:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:21:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432529802] [2025-03-08 21:21:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:21:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:56,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:21:56,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:21:56,052 INFO L87 Difference]: Start difference. First operand 655 states and 937 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 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-03-08 21:21:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:56,327 INFO L93 Difference]: Finished difference Result 1263 states and 1821 transitions. [2025-03-08 21:21:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:21:56,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 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 100 [2025-03-08 21:21:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:56,330 INFO L225 Difference]: With dead ends: 1263 [2025-03-08 21:21:56,330 INFO L226 Difference]: Without dead ends: 661 [2025-03-08 21:21:56,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:21:56,331 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:56,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2257 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:21:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-08 21:21:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2025-03-08 21:21:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 635 states have (on average 1.4188976377952756) internal successors, (901), 651 states have internal predecessors, (901), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 943 transitions. [2025-03-08 21:21:56,350 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 943 transitions. Word has length 100 [2025-03-08 21:21:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:56,351 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 943 transitions. [2025-03-08 21:21:56,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 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-03-08 21:21:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 943 transitions. [2025-03-08 21:21:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 21:21:56,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:56,352 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:21:56,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -564871155, now seen corresponding path program 1 times [2025-03-08 21:21:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87001317] [2025-03-08 21:21:56,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:56,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:21:56,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:21:56,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:56,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:21:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87001317] [2025-03-08 21:21:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87001317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:21:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931018371] [2025-03-08 21:21:56,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:56,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:56,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:56,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:21:56,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:21:56,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:21:56,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:21:56,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:56,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 21:21:56,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:21:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:21:56,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:21:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931018371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:21:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:21:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-08 21:21:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262149543] [2025-03-08 21:21:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:21:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:21:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:21:56,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:21:56,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:21:56,911 INFO L87 Difference]: Start difference. First operand 661 states and 943 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:21:57,245 INFO L93 Difference]: Finished difference Result 1279 states and 1838 transitions. [2025-03-08 21:21:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:21:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 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 101 [2025-03-08 21:21:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:21:57,248 INFO L225 Difference]: With dead ends: 1279 [2025-03-08 21:21:57,249 INFO L226 Difference]: Without dead ends: 667 [2025-03-08 21:21:57,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:21:57,252 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 42 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:21:57,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2705 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:21:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-08 21:21:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 649. [2025-03-08 21:21:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 639 states have internal predecessors, (883), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:21:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 925 transitions. [2025-03-08 21:21:57,269 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 925 transitions. Word has length 101 [2025-03-08 21:21:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:21:57,269 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 925 transitions. [2025-03-08 21:21:57,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:21:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 925 transitions. [2025-03-08 21:21:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 21:21:57,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:21:57,270 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 21:21:57,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:21:57,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:57,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:21:57,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:21:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1469091366, now seen corresponding path program 1 times [2025-03-08 21:21:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:21:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828408958] [2025-03-08 21:21:57,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:21:57,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:21:57,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:21:57,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:57,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:21:57,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:21:57,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828408958] [2025-03-08 21:21:57,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828408958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:21:57,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317901746] [2025-03-08 21:21:57,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:21:57,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:21:57,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:21:57,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:21:57,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:21:57,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:21:58,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:21:58,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:21:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:21:58,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:21:58,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:11,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:22:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317901746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:22:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-08 21:22:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461644387] [2025-03-08 21:22:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:11,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:22:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:22:11,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:22:11,892 INFO L87 Difference]: Start difference. First operand 649 states and 925 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:16,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 21:22:19,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 21:22:23,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 21:22:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:24,076 INFO L93 Difference]: Finished difference Result 1247 states and 1793 transitions. [2025-03-08 21:22:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:22:24,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 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 101 [2025-03-08 21:22:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:24,079 INFO L225 Difference]: With dead ends: 1247 [2025-03-08 21:22:24,079 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 21:22:24,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:22:24,081 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 12 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:24,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2690 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2025-03-08 21:22:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 21:22:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 649. [2025-03-08 21:22:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4173354735152488) internal successors, (883), 639 states have internal predecessors, (883), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:22:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 925 transitions. [2025-03-08 21:22:24,099 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 925 transitions. Word has length 101 [2025-03-08 21:22:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 925 transitions. [2025-03-08 21:22:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:22:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 925 transitions. [2025-03-08 21:22:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 21:22:24,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:24,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:22:24,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:24,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:24,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:24,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -469853271, now seen corresponding path program 1 times [2025-03-08 21:22:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475217400] [2025-03-08 21:22:24,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:24,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:22:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:22:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:24,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:22:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:24,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475217400] [2025-03-08 21:22:24,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475217400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:24,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:22:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544151045] [2025-03-08 21:22:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:24,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:22:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:24,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:22:24,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:24,639 INFO L87 Difference]: Start difference. First operand 649 states and 925 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 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-03-08 21:22:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:25,095 INFO L93 Difference]: Finished difference Result 1269 states and 1822 transitions. [2025-03-08 21:22:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:22:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 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 103 [2025-03-08 21:22:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:25,098 INFO L225 Difference]: With dead ends: 1269 [2025-03-08 21:22:25,098 INFO L226 Difference]: Without dead ends: 681 [2025-03-08 21:22:25,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:22:25,100 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 26 mSDsluCounter, 3114 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:25,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3615 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:22:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-08 21:22:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 669. [2025-03-08 21:22:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 643 states have (on average 1.4105754276827371) internal successors, (907), 659 states have internal predecessors, (907), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:22:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 949 transitions. [2025-03-08 21:22:25,116 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 949 transitions. Word has length 103 [2025-03-08 21:22:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:25,118 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 949 transitions. [2025-03-08 21:22:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 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-03-08 21:22:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 949 transitions. [2025-03-08 21:22:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 21:22:25,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:25,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:22:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:22:25,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1726070397, now seen corresponding path program 1 times [2025-03-08 21:22:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:25,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203069200] [2025-03-08 21:22:25,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:25,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:22:25,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:22:25,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:25,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:22:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203069200] [2025-03-08 21:22:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203069200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526798270] [2025-03-08 21:22:25,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:25,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:25,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:22:25,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:22:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:22:25,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:25,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:25,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 21:22:25,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:22:25,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:22:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526798270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:22:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 21:22:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025023783] [2025-03-08 21:22:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:25,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:22:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:25,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:22:25,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:22:25,657 INFO L87 Difference]: Start difference. First operand 669 states and 949 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 21:22:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:25,743 INFO L93 Difference]: Finished difference Result 1233 states and 1764 transitions. [2025-03-08 21:22:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:22:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-03-08 21:22:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:25,747 INFO L225 Difference]: With dead ends: 1233 [2025-03-08 21:22:25,747 INFO L226 Difference]: Without dead ends: 672 [2025-03-08 21:22:25,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:22:25,749 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:25,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:22:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-08 21:22:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-08 21:22:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 645 states have (on average 1.4108527131782946) internal successors, (910), 662 states have internal predecessors, (910), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 953 transitions. [2025-03-08 21:22:25,767 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 953 transitions. Word has length 103 [2025-03-08 21:22:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 953 transitions. [2025-03-08 21:22:25,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 21:22:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 953 transitions. [2025-03-08 21:22:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 21:22:25,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:25,769 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] [2025-03-08 21:22:25,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 21:22:25,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:25,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1963291193, now seen corresponding path program 1 times [2025-03-08 21:22:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-03-08 21:22:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:26,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:22:26,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:22:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 21:22:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-03-08 21:22:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679417182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827369405] [2025-03-08 21:22:26,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:26,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:26,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:26,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:26,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:22:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 21:22:26,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 21:22:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 21:22:26,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 21:22:26,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 21:22:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827369405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:26,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:26,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:22:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795246415] [2025-03-08 21:22:26,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:26,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:22:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:26,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:22:26,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:26,654 INFO L87 Difference]: Start difference. First operand 672 states and 953 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 21:22:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:26,890 INFO L93 Difference]: Finished difference Result 1249 states and 1787 transitions. [2025-03-08 21:22:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 21:22:26,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 105 [2025-03-08 21:22:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:26,895 INFO L225 Difference]: With dead ends: 1249 [2025-03-08 21:22:26,895 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 21:22:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-08 21:22:26,896 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 11 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:26,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2528 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:22:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 21:22:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2025-03-08 21:22:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 653 states have (on average 1.4119448698315467) internal successors, (922), 670 states have internal predecessors, (922), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 965 transitions. [2025-03-08 21:22:26,915 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 965 transitions. Word has length 105 [2025-03-08 21:22:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:26,915 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 965 transitions. [2025-03-08 21:22:26,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 21:22:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 965 transitions. [2025-03-08 21:22:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 21:22:26,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:26,917 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:22:26,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 21:22:27,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:27,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:27,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1035994115, now seen corresponding path program 2 times [2025-03-08 21:22:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032558763] [2025-03-08 21:22:27,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:22:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:27,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-08 21:22:27,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 109 statements. [2025-03-08 21:22:27,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:22:27,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 21:22:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:27,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032558763] [2025-03-08 21:22:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032558763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:27,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:27,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:22:27,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208565056] [2025-03-08 21:22:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:27,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:22:27,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:27,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:22:27,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:22:27,335 INFO L87 Difference]: Start difference. First operand 681 states and 965 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 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-03-08 21:22:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:27,686 INFO L93 Difference]: Finished difference Result 1299 states and 1858 transitions. [2025-03-08 21:22:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:22:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 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 109 [2025-03-08 21:22:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:27,690 INFO L225 Difference]: With dead ends: 1299 [2025-03-08 21:22:27,690 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 21:22:27,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:22:27,692 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 8 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2674 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:22:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 21:22:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-03-08 21:22:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 659 states have (on average 1.4081942336874052) internal successors, (928), 676 states have internal predecessors, (928), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 971 transitions. [2025-03-08 21:22:27,710 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 971 transitions. Word has length 109 [2025-03-08 21:22:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:27,710 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 971 transitions. [2025-03-08 21:22:27,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 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-03-08 21:22:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 971 transitions. [2025-03-08 21:22:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 21:22:27,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:27,712 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:22:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:22:27,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -322515937, now seen corresponding path program 1 times [2025-03-08 21:22:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407675278] [2025-03-08 21:22:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:27,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 21:22:27,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 21:22:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:27,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 21:22:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407675278] [2025-03-08 21:22:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407675278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438650550] [2025-03-08 21:22:27,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:27,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:27,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 21:22:28,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 21:22:28,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 21:22:28,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:28,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:28,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 21:22:28,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 21:22:28,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 21:22:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438650550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:28,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-08 21:22:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781598447] [2025-03-08 21:22:28,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:22:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:28,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:22:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:22:28,495 INFO L87 Difference]: Start difference. First operand 687 states and 971 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:22:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:28,815 INFO L93 Difference]: Finished difference Result 1273 states and 1813 transitions. [2025-03-08 21:22:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 21:22:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2025-03-08 21:22:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:28,818 INFO L225 Difference]: With dead ends: 1273 [2025-03-08 21:22:28,818 INFO L226 Difference]: Without dead ends: 691 [2025-03-08 21:22:28,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:22:28,821 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 28 mSDsluCounter, 3454 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3953 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:28,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3953 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:22:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-08 21:22:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-03-08 21:22:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 663 states have (on average 1.4042232277526394) internal successors, (931), 680 states have internal predecessors, (931), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 974 transitions. [2025-03-08 21:22:28,838 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 974 transitions. Word has length 109 [2025-03-08 21:22:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:28,838 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 974 transitions. [2025-03-08 21:22:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:22:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 974 transitions. [2025-03-08 21:22:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 21:22:28,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:28,839 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:22:28,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:29,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 507993887, now seen corresponding path program 2 times [2025-03-08 21:22:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197147743] [2025-03-08 21:22:29,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:22:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:29,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-08 21:22:29,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 113 statements. [2025-03-08 21:22:29,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:22:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 21:22:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197147743] [2025-03-08 21:22:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197147743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:29,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:29,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:22:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738359730] [2025-03-08 21:22:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:22:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:29,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:22:29,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:29,360 INFO L87 Difference]: Start difference. First operand 691 states and 974 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 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-03-08 21:22:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:29,780 INFO L93 Difference]: Finished difference Result 1332 states and 1892 transitions. [2025-03-08 21:22:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:22:29,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 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 113 [2025-03-08 21:22:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:29,783 INFO L225 Difference]: With dead ends: 1332 [2025-03-08 21:22:29,783 INFO L226 Difference]: Without dead ends: 725 [2025-03-08 21:22:29,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:29,785 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 17 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:29,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4036 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:22:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-08 21:22:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 701. [2025-03-08 21:22:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 673 states have (on average 1.401188707280832) internal successors, (943), 690 states have internal predecessors, (943), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 986 transitions. [2025-03-08 21:22:29,803 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 986 transitions. Word has length 113 [2025-03-08 21:22:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:29,804 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 986 transitions. [2025-03-08 21:22:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 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-03-08 21:22:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 986 transitions. [2025-03-08 21:22:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 21:22:29,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:29,806 INFO L218 NwaCegarLoop]: trace histogram [10, 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] [2025-03-08 21:22:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:22:29,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:29,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1787605907, now seen corresponding path program 1 times [2025-03-08 21:22:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957862405] [2025-03-08 21:22:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:29,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:22:29,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:22:29,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:29,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 21:22:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957862405] [2025-03-08 21:22:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957862405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051595132] [2025-03-08 21:22:30,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:30,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:30,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 21:22:30,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:22:30,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:22:30,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:30,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 21:22:30,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 21:22:30,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:22:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 21:22:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051595132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:22:30,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:22:30,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2025-03-08 21:22:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292799047] [2025-03-08 21:22:30,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:22:30,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:22:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:22:30,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:22:30,862 INFO L87 Difference]: Start difference. First operand 701 states and 986 transitions. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 21:22:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:31,408 INFO L93 Difference]: Finished difference Result 1305 states and 1854 transitions. [2025-03-08 21:22:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 21:22:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2025-03-08 21:22:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:31,412 INFO L225 Difference]: With dead ends: 1305 [2025-03-08 21:22:31,412 INFO L226 Difference]: Without dead ends: 714 [2025-03-08 21:22:31,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 21:22:31,414 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 32 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:31,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4465 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:22:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-08 21:22:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 710. [2025-03-08 21:22:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 682 states have (on average 1.404692082111437) internal successors, (958), 699 states have internal predecessors, (958), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1001 transitions. [2025-03-08 21:22:31,433 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1001 transitions. Word has length 114 [2025-03-08 21:22:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:31,433 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1001 transitions. [2025-03-08 21:22:31,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 21:22:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1001 transitions. [2025-03-08 21:22:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 21:22:31,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:31,434 INFO L218 NwaCegarLoop]: trace histogram [19, 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] [2025-03-08 21:22:31,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 21:22:31,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 21:22:31,635 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:31,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash -980408585, now seen corresponding path program 2 times [2025-03-08 21:22:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752569156] [2025-03-08 21:22:31,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:22:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:31,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-08 21:22:31,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 123 statements. [2025-03-08 21:22:31,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:22:31,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-08 21:22:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752569156] [2025-03-08 21:22:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752569156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:22:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:22:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:22:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616246832] [2025-03-08 21:22:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:22:31,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:22:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:22:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:22:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:31,984 INFO L87 Difference]: Start difference. First operand 710 states and 1001 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 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-03-08 21:22:36,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 21:22:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:22:36,547 INFO L93 Difference]: Finished difference Result 1355 states and 1928 transitions. [2025-03-08 21:22:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:22:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 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 123 [2025-03-08 21:22:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:22:36,550 INFO L225 Difference]: With dead ends: 1355 [2025-03-08 21:22:36,550 INFO L226 Difference]: Without dead ends: 734 [2025-03-08 21:22:36,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:22:36,551 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 13 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:22:36,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3608 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 21:22:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-08 21:22:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 718. [2025-03-08 21:22:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 690 states have (on average 1.4028985507246376) internal successors, (968), 707 states have internal predecessors, (968), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:22:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1011 transitions. [2025-03-08 21:22:36,566 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1011 transitions. Word has length 123 [2025-03-08 21:22:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:22:36,567 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1011 transitions. [2025-03-08 21:22:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 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-03-08 21:22:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1011 transitions. [2025-03-08 21:22:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 21:22:36,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:22:36,568 INFO L218 NwaCegarLoop]: trace histogram [19, 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] [2025-03-08 21:22:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:22:36,568 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:22:36,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:22:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -219715970, now seen corresponding path program 1 times [2025-03-08 21:22:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:22:36,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371539923] [2025-03-08 21:22:36,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:36,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:22:36,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 21:22:36,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 21:22:36,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:36,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 21:22:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:22:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371539923] [2025-03-08 21:22:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371539923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:22:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223126338] [2025-03-08 21:22:37,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:22:37,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:22:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:22:37,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:22:37,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 21:22:37,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 21:22:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 21:22:38,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:22:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:22:38,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 21:22:38,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:22:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 107 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 21:22:38,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:23:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 125 refuted. 9 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 21:23:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223126338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:23:14,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:23:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-08 21:23:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903665879] [2025-03-08 21:23:14,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:23:14,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 21:23:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:23:14,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 21:23:14,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=471, Unknown=9, NotChecked=0, Total=702 [2025-03-08 21:23:14,816 INFO L87 Difference]: Start difference. First operand 718 states and 1011 transitions. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:23:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:23:16,104 INFO L93 Difference]: Finished difference Result 1331 states and 1892 transitions. [2025-03-08 21:23:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 21:23:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 123 [2025-03-08 21:23:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:23:16,107 INFO L225 Difference]: With dead ends: 1331 [2025-03-08 21:23:16,107 INFO L226 Difference]: Without dead ends: 727 [2025-03-08 21:23:16,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=619, Invalid=1094, Unknown=9, NotChecked=0, Total=1722 [2025-03-08 21:23:16,109 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 10 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4575 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:23:16,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4575 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:23:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-08 21:23:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-03-08 21:23:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 699 states have (on average 1.396280400572246) internal successors, (976), 716 states have internal predecessors, (976), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-08 21:23:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1019 transitions. [2025-03-08 21:23:16,124 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1019 transitions. Word has length 123 [2025-03-08 21:23:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:23:16,124 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1019 transitions. [2025-03-08 21:23:16,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:23:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1019 transitions. [2025-03-08 21:23:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 21:23:16,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:23:16,125 INFO L218 NwaCegarLoop]: trace histogram [28, 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] [2025-03-08 21:23:16,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 21:23:16,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:23:16,327 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:23:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:23:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash -943296916, now seen corresponding path program 2 times [2025-03-08 21:23:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:23:16,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291192983] [2025-03-08 21:23:16,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:23:16,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:23:16,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-03-08 21:23:16,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 132 statements. [2025-03-08 21:23:16,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:23:16,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat